,
,
, The Marriage Problem, American Journal of Mathematics, vol.72, p.29327, 1950.
, Two Theorems in Graph Teory, Proceedings of the National Academy of Sciences, vol.43, pp.842-844, 1957.
, Flows in Networks, p.9780691146676, 1962.
, On random matrices, Publication of the Mathematical Institute of the Hungarian Academy of Science, 1963.
, Graphes et hypergraphes. Dunod Université. Dunod, 1973.
, Some Properties of Nonnegative Matrices and their Permanents, In: Soviet Mathematics Doklady, vol.14, issue.4, pp.945-949, 1973.
, A Language and a Program for Stating and Solving Combinatorial Problems, Artif. Intell, vol.10, pp.90029-90031, 1978.
, The Complexity of Computing the Permanent, In: Theor. Comput. Sci, vol.8, pp.90044-90050, 1979.
, On the theory of the matching polynomial, Journal of Graph Theory, vol.5, pp.137-144, 1981.
, The Constraint Logic Programming Language CHIP, pp.693-702, 1988.
, Extending CHIP in order to solve complex scheduling and placement problems, JFPL'92, 1 ères Journées Francophones de Programmation Logique, p.51, 1992.
URL : https://hal.archives-ouvertes.fr/hal-00442821
, Hard and Easy Distributions of SAT Problems, Proceedings of the 10th National Conference on Artificial Intelligence, pp.459-465, 1992.
, Introducing global constraints in CHIP, In: Mathematical and Computer Modelling, vol.20, pp.895-7177, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00442810
, Groups and Geometry, p.198534515, 1994.
, Time and resource constrained scheduling : a constraint satisfaction approach, 1994.
, A Filtering Algorithm for Constraints of Difference in CSPs, pp.362-367, 1994.
, Generalized Arc Consistency for Global Cardinality Constraint, Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, AAAI 96, IAAI 96, vol.1, pp.209-215, 1996.
, Sharp thresholds of graph properties, and the k-sat problem, J. Amer. Math. Soc, vol.12, pp.1017-1054, 1999.
, Automatic Generation of Music Programs, Principles and Practice of Constraint Programming -CP'99, 5th International Conference, vol.1713, pp.331-345, 1999.
, Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family, 7th International Conference, vol.2239, pp.211-224, 2001.
, Revisiting the Cardinality Operator and Introducing the Cardinality-Path Constraint Family, Logic Programming, 17th International Conference, vol.2237, pp.59-73, 2001.
, The alldifferent Constraint: A Survey, 2001.
, Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem, 2002.
, Boosting Systematic Search by Weighting Constraints, Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, pp.146-150, 2004.
, Boosting Systematic Search by Weighting Constraints, Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, pp.1-58603, 2004.
, A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, J. ACM, vol.51, pp.671-697, 2004.
, An upper bound for the permanent of (0,1)-matrices, Linear Algebra and its Applications, vol.377, pp.291-295, 2004.
, A Regular Language Membership Constraint for Finite Sequences of Variables, Principles and Practice of Constraint Programming -CP, vol.3258, pp.482-495, 2004.
, Impact-Based Search Strategies for Constraint Programming, 10th International Conference, vol.3258, pp.557-571, 2004.
, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, vol.3524, 2005.
, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, vol.3524, pp.64-78, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00754042
, Among, Common and Disjoint Constraints, Recent Advances in Constraints, Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, vol.3978, pp.29-43, 2005.
, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, vol.3524, pp.79-93, 2005.
, The Range and Roots Constraints: Specifying Counting and Occurrence Problems". In: IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, p.938075934, 2005.
, Handbook of Constraint Programming (Foundations of Artificial Intelligence), p.444527265, 2006.
, The Traveling Salesman Problem: A Computational Study, Princeton Series in Applied Mathematics), p.691129932, 2007.
, From Sampling to Model Counting, IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, pp.2293-2299, 2007.
, An upper bound for the number of perfect matchings in graphs, 2008.
, Range and Roots: Two common patterns for specifying and propagating counting and occurrence constraints, Artif. Intell, vol.173, pp.1054-1078, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00382606
, Matching Theory, 2009.
, Enumerative Combinatorics, vol.1, p.9781107602625, 2011.
, Theory of Groups of Finite Order. Cambridge Library Collection -Mathematics, 2012.
, Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables, Random Struct. Algorithms, vol.41, pp.334-364, 2012.
, Activity-Based Search for Black-Box Constraint Programming Solvers, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems -9th International Conference, CPAIOR 2012, vol.7298, pp.228-243, 2012.
, Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems, J. Artif. Intell. Res, vol.43, pp.173-210, 2012.
, When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent, Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00867576
, Matchings in Random Biregular Bipartite Graphs, Electr. J. Comb, vol.20, issue.1, p.60, 2013.
, Sicstus PROLOG User's Manual 4.3. Books On Demand -Proquest, p.9783735737441, 2014.
, Constrained Sampling and Counting: Universal Hashing Meets SAT Solving, 2015.
, , 2016.
, Approximating the Permanent of a Random Matrix with Vanishing Mean, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, pp.23-34, 2018.
, Accelerating Counting-Based Search, Integration of Constraint Programming, Artificial Intelligence, and Operations Research -15th International Conference, vol.10848, pp.245-253, 2018.
, Estimating the Number of Solutions of Cardinality Constraints through range and roots Decompositions, Principles and Practice of Constraint Programming -25th International Conference, CP 2019, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02276566
, Revisiting Counting Solutions for the Global Cardinality Constraint, Journal of Artificial Intelligence Research, vol.66, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02276554
, From Support Propagation to Belief Propagation in Constraint Programming, J. Artif. Intell. Res, vol.66, pp.123-150, 2019.
, CSPLib Problem 067: Quasigroup Completion
, CSPLib Problem 026: Sports Tournament Scheduling
, ont développé deux nouvelles contraintes globales, range et roots , qui peuvent être utilisées pour spécifier de nombreuses contraintes de cardinalité. En d'autres termes, pour presque chaque contrainte de cardinalité, il existe un modèle équivalent utilisant uniquement les contraintes range et roots (et quelques contraintes arithmétiques). Nous montrons comment utiliser les décompositions range et roots pour dénombrer les solutions. Plus précisément, nous développons une approche probabiliste, Nous cardinalité initiales, 2009.