1. Beldiceanu, N., & Carlsson, M. (2001). Pruning for the minimum constraint family and for the number of distinct values constraint family. In Walsh, T. (Ed.) Principles and Practice of Constraint Programming – CP 2001, volume 2239 of Lecture Notes in Computer Science, (pp. 211–224). Berlin Heidelberg: Springer.
2. Beldiceanu, N., Carlsson, M., & Thiel, S. (2002). Cost-filtering algorithms for the two sides of the sum of weights of distinct values constraint. Technical report – T2002-14: Swedish Institute of Computer Science.
3. Benchimol, P., Van Hoeve, W.J., Régin, J.-C., Rousseau, L.-M., & Rueher, M. (2012). Improved filtering for weighted circuit constraints. Constraints, 17(3), 205–233.
4. Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., & Walsh, T. (2006). Filtering algorithms for the nvalue constraint. Constraints, 11(4), 271–293.
5. Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.-G., & Walsh, T. (2010). Decomposition of the nvalue constraint In Cohen, D. (Ed.) Principles and Practice of Constraint Programming – CP 2010, volume 6308 of Lecture Notes in Computer Science, (pp. 114–128). Berlin Heidelberg: Springer.