Facile: a functional constraint library, Proceeding of CICLOPS2001, 2001. ,
URL : https://hal.archives-ouvertes.fr/hal-00938018
Kirkman triple systems of order 21 with nontrivial automorphism group, Mathematics of Computation, vol.71, issue.238, 2001. ,
DOI : 10.1090/S0025-5718-01-01372-2
Symmetry Breaking, CP'01 [3], pp.93-107 ,
DOI : 10.1007/3-540-45578-7_7
Global Cut Framework for Removing Symmetries, CP'01 [3], pp.77-92 ,
DOI : 10.1007/3-540-45578-7_6
CSPlib: a problem library for constraints ,
Symmetry breaking during search in contraint programming, pp.599-603, 2000. ,
Interval propagation to reason about sets: Definition and implementation of a practical language, Constraints, vol.16, issue.3?4, pp.191-244 ,
DOI : 10.1007/BF00137870
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs, SIAM Journal on Computing, vol.2, issue.4, pp.225-231, 1973. ,
DOI : 10.1137/0202019
Note on an unanswered prize question, Cambridge and Dublin Mathematics Journal, vol.5, pp.255-262, 1850. ,
Combinatorial Theory, 1983. ,
Practical graph isomorphism, II, Journal of Symbolic Computation, vol.60, pp.45-87, 1981. ,
DOI : 10.1016/j.jsc.2013.09.003
Randomised backtracking for linear pseudo-boolean constraint problems, CPAIOR'02 [4], pp.7-19 ,
Generalized arc consistency for global cardinality constraint, Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1996. ,
Global reasoning on sets, Formul'01, Workshop Modelling and Problem Formulation, 2001. ,
Heuristic Constraint Propagation, CPAIOR'02 [4], pp.191-204 ,
DOI : 10.1007/3-540-46135-3_55
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.6078
Reducing symmetry in a combinatorial design problem, CPAIOR'01, pp.351-359, 2001. ,