C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, C. Quimper et al., The parameterized complexity of global constraints, Proceedings AAAI, pp.235-240, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00272791

G. Butler, Fundamental Algorithms for Permutation Groups, Lecture Notes in Computer Science, vol.559, 1991.
DOI : 10.1007/3-540-54955-2

J. Crawford, M. Ginsberg, E. Luks, and A. Roy, Symmetry-breaking predicates for search problems, KR, pp.148-159, 1996.

R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity : A framework for systematically confronting computational intractability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.49-99, 1997.
DOI : 10.1007/978-1-4612-0515-9

I. P. Gent, W. Harvey, and T. Kelsey, Groups and Constraints: Symmetry Breaking during Search, CP 2002, pp.415-430, 2002.
DOI : 10.1007/3-540-46135-3_28

G. Gottlob and S. Szeider, Fixedparameter algorithms for artificial intelligence, constraint satisfaction and database problems

B. D. Mckay, nauty user's guide (version 2.4), 2009.

J. Puget, Breaking symmetries in all different problems, Proceedings IJCAI'05, pp.272-277, 2005.

J. Régin, Generalized arc consistency for global cardinality constraint, pp.209-215, 1996.