K. Artiouchine, P. Baptiste, and C. Durr, Runway sequencing with holding patterns, European Journal of OR, 2008.

N. Beldiceanu, C. , and M. , Revisiting the cardinality operator and introducing cardinality-path constraint family, Proc. of the Int. Conf. on Logic Programming (ICLP, 2001.

N. Beldiceanu and E. Contegean, Introducing global constraints in CHIP, Mathematical Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00442810

N. Beldiceanu, Global constraints as graph properties on a structured network of elementary constraints of the same type, 2000.

C. Bessiere and J. Régin, Arc consistency for general constraint networks: Preliminary results, Proc. of the 15th IJCAI, 1997.

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The complexity of global constraints, Proc. of the 19th National Conf. on AI. AAAI, 2004.
URL : https://hal.archives-ouvertes.fr/lirmm-00108868

C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, The range and roots constraints: Specifying counting and occurrence problems, Proc. of 19th IJCAI, pp.60-65, 2005.

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, Among, common and disjoint constraints, Recent Advances in Constraints: Joint ERCIM/CoLogNET Int. Workshop on Constraint Solving and Constraint Logic Programming, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00378928

C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, Filtering algorithms for the NVALUE constraint, Constraints, vol.11, issue.4, pp.271-293, 2006.

C. Bessière, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, The ROOTS constraint, Proc. of 12th Int. Conf. on Principles and Practices of Constraint Programming, p.2006, 2006.

C. Bessière, E. Hebrard, B. Hnich, and T. Walsh, The complexity of global constraints, Constraints, vol.12, issue.2, pp.239-259, 2007.

M. Cooper, D. Cohen, and P. Jeavons, Characterizing tractable constraints, Artificial Intelligence, vol.65, pp.347-361, 1994.

J. Crawford, G. Luks, M. Ginsberg, and A. Roy, Symmetry breaking predicates for search problems, Proc. of the 5th Int. Conf. on Knowledge Representation and Reasoning, 1996.

R. Dechter and J. Pearl, Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence, vol.34, issue.1, pp.1-38, 1987.

R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence, vol.38, pp.353-366, 1989.

R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity: A framework for systematically confronting computational intractability, Contemporary Trends in Discrete Mathematics: From DIMACS and DI-MATIA to the Future, pp.49-99, 1999.

E. Freuder, A sufficient condition for backtrack-free search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.

A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, and T. Walsh, Global constraints for lexicographic orderings, Proc. of 8th Int. Conf. on Principles and Practices of Constraint Programming, p.2002, 2002.

M. Garey, J. , and D. , Computers and intractability, 1979.

F. Pachet, R. , and P. , Automatic generation of music programs, Proc. of 5th Int. Conf. on Principles and Practice of Constraint Programming (CP99), 1999.

J. ;. Puget, C. Quimper, W. , and T. , On the satisfiability of symmetrical constrained satisfaction problems, 13th Int. Conf. on Principles and Practices of Constraint Programming, p.2007, 1993.

C. Quimper, Enforcing domain consistency on the extended global cardinality constraint is NP-hard, 2003.

J. Régin and M. Rueher, A global constraint combining a sum constraint and difference constraints, Proc. of 6th Int. Conf. on Principles and Practice of Constraint Programming (CP2000), 2000.

J. Régin, A filtering algorithm for constraints of difference in CSPs, Proc. of the 12th National Conf. on AI. AAAI, 1994.

J. Régin, Generalized arc consistency for global cardinality constraints, Proc. of the 13th National Conf. on AI. AAAI, 1996.

J. Régin, The global minimum distance constraint, 1997.

M. Samer and S. Szeider, Tractable cases of the extended global cardinality constraint, Proc. of 9th Int. Conf. on Principles and Practice of Constraint Programming (CP2003), 2008.

T. Walsh, Breaking value symmetry, Proc. of 13th Int. Conf. on Principles and Practices of Constraint Programming, p.2007, 2007.

R. Williams, C. Gomes, and B. Selman, Backdoors to typical case complexity, Proc. of the 18th IJCAI, 2003.