N. Beldiceanu, Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family, Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, pp.211-224, 2001.
DOI : 10.1007/3-540-45578-7_15

N. Beldiceanu, M. Carlsson, and S. Thiel, Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint, 2002.

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The Tractability of Global Constraints, Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, pp.716-720, 2004.
DOI : 10.1007/978-3-540-30201-8_53
URL : https://hal.archives-ouvertes.fr/lirmm-00108916

R. Debruyne and C. Bessì-ere, Some Practicable filtering Techniques for the Constraint Satisfaction Problem, Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pp.412-417, 1997.

M. Dincbas, P. Van-hentenryck, H. Simonis, and A. Aggoun, The Constraint Logic Programming Language CHIP, Proceedings of the International Conference on Fifth Generation Computer Systems, pp.693-702, 1988.

P. Roy and F. Pachet, Automatic Generation of Music Programs, Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP-99), pp.331-345, 1999.

O. Favaron, M. Mahéo, and J. Saclé, Some eigenvalue properties in graphs (conjectures of Graffiti ??? II), Discrete Mathematics, vol.111, issue.1-3, pp.197-220, 1993.
DOI : 10.1016/0012-365X(93)90156-N

S. Shahar, G. Even, and D. Rawitz, Hitting Sets when the VC-dimension is Small, 2004.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.

M. Halldórsson and J. Radhakrishnan, Greed is good, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.439-448, 1994.
DOI : 10.1145/195058.195221

V. Th, M. Paschos, and . Demange, Improved Approximations for Maximum Independent Set via Approximation Chains, Applied Mathematical Letters, vol.10, pp.105-110, 1997.

E. Marzewski, P. R. Ostergard, and W. D. Weakley, Values of Domination Numbers of the Queen's Graph, Fund. Math. Electronic Journal of Combinatorics, vol.33, issue.8, pp.303-3071, 1945.

T. Petit, J. C. Régin, and C. Bessiere, Specific Filtering Algorithms for Over-Constrained Problems, Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, pp.451-463, 2001.
DOI : 10.1007/3-540-45578-7_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2556

P. Prosser, Binary Constraint Satisfaction Problems: some are harder than others

J. C. Régin, A Filtering Algorithm for Constraints of Difference in CSPs, Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), pp.362-367, 1994.

P. Turán, On an Extremal Problem in Graph Theory, Hungarian), Mat. Fiz. Lapok, pp.436-452, 1941.