X. Lorca, Tree-based Graph Partitioning Constraint ISBN 978- 1-84821-303-6. Version française : Contraintes de Partitionnement de Graphe. Hermès Sciences, collection Programmation par Contraintes, 2011.

J. Fages, X. Lorca, and L. Rousseau, The salesman and the tree: the importance of search in CP, Constraints, vol.173, issue.18, 2014.
DOI : 10.1007/s10601-014-9178-2
URL : https://hal.archives-ouvertes.fr/hal-01436214

C. Prud-'homme, X. Lorca, and N. Jussien, Explanation-Based Large Neighborhood Search, Constraints Journal, 2014.

C. Prud-'homme, X. Lorca, N. Jussien, and R. Douence, Propagation Engine Prototyping with a Domain Specific Language, Constraints Journal, vol.19, issue.1, pp.57-76, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00867604

N. Beldiceanu, I. Katriel, and X. Lorca, Undirected forest constraints, Annals of Operations Research, vol.10, issue.1, pp.127-147, 2009.
DOI : 10.1007/s10479-008-0374-6
URL : https://hal.archives-ouvertes.fr/hal-00481471

N. Beldiceanu, P. Flener, and X. Lorca, Combining Tree Partitioning, Precedence, and Incomparability Constraints, Constraints, vol.21, issue.1, pp.459-489, 2008.
DOI : 10.1007/s10601-007-9040-x
URL : https://hal.archives-ouvertes.fr/hal-00481533

J. Fages, X. Lorca, and T. Petit, Self-decomposable Global Constraints, proceedings of the 21th European Conference on Artificial Intelligence, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088964

J. Fages and X. Lorca, Revisiting the tree Constraint, proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, 2011.
DOI : 10.1007/978-3-642-23786-7_22
URL : https://hal.archives-ouvertes.fr/hal-00644787

F. Hermenier, S. Demassey, and X. Lorca, The Bin-Repacking Scheduling Problem in Virtualized Datacenters, proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, 2011.

T. Petit, N. Beldiceanu, and X. Lorca, A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints, proceedings of the 22th International Joint Conference on Artificial Intelligence, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00754017

N. Beldiceanu, F. Hermenier, X. Lorca, and T. Petit, The Increasing Nvalue??Constraint, proceedings of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010.
DOI : 10.1007/978-3-642-13520-0_5
URL : https://hal.archives-ouvertes.fr/hal-00915800

G. Chabert, L. Jaulin, and X. Lorca, A Constraint on the Number of Distinct Vectors with Application to Localization, proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, 2009.
DOI : 10.1109/31.34669
URL : https://hal.archives-ouvertes.fr/hal-00428967

F. Hermenier, X. Lorca, J. Menaud, G. Müller, and J. , Entropy, Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, VEE '09, 2009.
DOI : 10.1145/1508293.1508300
URL : https://hal.archives-ouvertes.fr/inria-00320204

R. Douence, X. Lorca, and N. Loriant, Lazy Composition of Representations, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00403417

N. Beldiceanu and X. Lorca, Necessary Condition for Path Partitioning Constraints, proceedings of the 4th International Conference on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, 2007.
DOI : 10.1007/978-3-540-72397-4_11
URL : https://hal.archives-ouvertes.fr/hal-00481563

N. Beldiceanu, I. Katriel, and X. Lorca, Undirected Forest Constraints, proceedings of the 3th International Conference on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00481471

N. Beldiceanu, P. Flener, and X. Lorca, The tree Constraint, proceedings of the 2nd International Conference on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, 2005.
DOI : 10.1007/11493853_7
URL : https://hal.archives-ouvertes.fr/hal-00445174

. Bibliographie, H. S. Alstrup, . Lauridsen-p, and . Thorup-m, Dominators in linear time, SIAM J. Comput, vol.28, issue.6, pp.2117-2132, 1999.

B. A. Bessiere-c and C. R. Bouyakhf-e.-l, Adaptive Parameterized Consistency, Principles and Practice of Constraint Programming, pp.143-158, 2013.

B. J. Perron-l, Discrepancy-Bounded Depth First Search " , Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, Lecture Notes in Computer Science, pp.8-10, 2000.

. N. Beldiceanu, . Flener-p, and . Lorca-x, The tree Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.64-78, 2005.
DOI : 10.1007/11493853_7
URL : https://hal.archives-ouvertes.fr/hal-00445174

C. N. Beldiceanu and R. , Global Constraint Catalog, SICS, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00485396

. N. Beldiceanu, . Hermenier-f, . Lorca-x, and . Petit-t, The Increasing Nvalue??Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pp.25-39, 2010.
DOI : 10.1007/978-3-642-13520-0_5
URL : https://hal.archives-ouvertes.fr/hal-00915800

. N. Beldiceanu and . Simonis-h, A Model Seeker: Extracting Global Constraint Models from Positive Examples, Principles and Practice of Constraint Programming, 2012.
DOI : 10.1007/978-3-642-33558-7_13
URL : https://hal.archives-ouvertes.fr/hal-00754361

. Benchimol-p, R. J. Van-hoeve-w, R. , and R. M. , Improved filtering for weighted circuit constraints, Constraints, vol.26, issue.4, pp.205-233, 2012.
DOI : 10.1007/s10601-012-9119-x

. C. Bessière and R. C. Freuder-e, Using Inference to Reduce Arc Consistency Computation, IJCAI, pp.592-599, 1995.

R. C. Bessière and . C. Freuder-e, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Principles and Practice of Constraint Programming, pp.61-75, 1996.
DOI : 10.1007/3-540-61551-2_66

. C. Bessière and R. C. Freuder-e, Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence, vol.107, issue.1, pp.125-148, 1999.
DOI : 10.1016/S0004-3702(98)00105-2

. C. Bessière and . Van-hentenryck-p, To Be or Not to Be ... a Global Constraint, Principles and Practice of Constraint Programming, pp.789-794, 2003.
DOI : 10.1007/978-3-540-45193-8_54

C. Bessière, H. B. Hebrard-e, and W. T. , The Complexity of Global Constraints, AAAI, pp.112-117, 2004.

. C. Bessière, H. B. Hebrard-e, and W. T. Kiziltan-z, Filtering Algorithms for the NValue Constraint, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.79-93, 2005.
DOI : 10.1007/11493853_8

R. C. Bessière and Y. R. Zhang-y, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.
DOI : 10.1016/j.artint.2005.02.004

R. F. Van-beek-p and . Walsh-t, Constraint Propagation, Handbook of Constraint Programming, 2006.

. C. Bessière, H. B. Hebrard-e, and W. T. Kiziltan-z, SLIDE: A useful special case of the CARDPATH constraint, ECAI, 2008.

. C. Bessiere and W. T. Stergiou-k, Domain filtering consistencies for non-binary constraints, Artificial Intelligence, vol.172, issue.6-7, pp.800-822, 2008.
DOI : 10.1016/j.artint.2007.10.016
URL : https://hal.archives-ouvertes.fr/lirmm-00250086

C. C. Bessiere, . Hebrard-e, . Katsirelos-g, . Lazaar-n, Q. N. Nar-odytska et al., Constraint Acquisition via Partial Queries, IJCAI, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00830325

F. Boussemart, . Hemery-f, and . Lecoutre-c, Revision ordering heuristics for the Constraint Satisfaction Problem, 1st International Workshop on Constraint Propagation and Implementation held with CP'04(CPAI'04), pp.9-43, 2004.

. A. Buchsbaum, R. A. Kaplan-h, and W. J. , A new, simpler linear-time dominators algorithm, ACM Transactions on Programming Languages and Systems, vol.20, issue.6, pp.1265-1296, 1998.
DOI : 10.1145/295656.295663
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7392

C. H. Jussien-n, Identifying and exploiting problem structures using explanation-based constraint programming, Constraints, vol.11, issue.4, pp.295-313, 2006.

J. A. Chmeiss, EFFICIENT PATH-CONSISTENCY PROPAGATION, International Journal on Artificial Intelligence Tools, vol.07, issue.02, pp.121-142, 1998.
DOI : 10.1142/S0218213098000081

. A. Colmerauer, An introduction to Prolog III, Communications of the ACM, vol.33, issue.7, pp.69-90, 1990.
DOI : 10.1145/79204.79210

D. E. Perron-l, Structured vs Unstructured Large Neighborhood Search: A Case Study on Job-Shop Scheduling Problems with Earliness and Tardiness Costs, Principles and Practice of Constraint Programming, pp.817-821, 2003.

. R. Debruyne and . Bessière-c, Domain Filtering Consistencies, J. Artif. Intell

. S. Demassey and R. Pesant-g, A Cost-Regular Based Hybrid Column Generation Approach, Constraints, vol.12, issue.4???5, pp.315-333, 2006.
DOI : 10.1007/s10601-006-9003-7
URL : https://hal.archives-ouvertes.fr/hal-00293562

D. A. Van, . Klint-p, and . Visser-j, Domain-specific languages: an annotated bibliography, SIGPLAN Not, vol.35, issue.6, pp.26-36, 2000.

D. G. Deville-y and . Dupont-p, Cp(graph): Introducing a graph computation domain in constraint programming, Principles and Practice of Constraint Programming de Lecture Notes in Computer Science, pp.211-225, 2005.

F. Lorca-x, Revisiting the tree Constraint, Principles and Practice of Constraint Programming, pp.271-285, 2011.

F. Lorca-x, Improving the Asymmetric TSP by Considering Graph Structure, 2012.

F. Lorca-x and R. , Une approche basée sur les contraintes pour résoudre le problème d'arbre recouvrant de coût minimum avec contraintes de degré, Actes des 9èmes Journées Francophones de Programmation par Contraintes, pp.119-122, 2013.

F. Lorca-x and . Petit-t, Self-decomposable Global Constraints, ECAI, 2014.

F. Lorce-x and R. , The Salesman and the Tree: the importance of search in CP, Constraints, 2014.

I. P. Gent, J. C. , and M. I. , Watched Literals for Constraint Propagation in Minion, Principles and Practice of Constraint Programming, pp.182-197, 2006.
DOI : 10.1007/11889205_15

I. P. Gent and M. I. Nightingale-p, Generalised arc consistency for the AllDifferent constraint: An empirical survey, Artificial Intelligence, vol.172, issue.18, pp.1973-2000, 2008.
DOI : 10.1016/j.artint.2008.10.006

G. P. Gent-i, M. I. , and M. N. , Lazy Explanations for Constraint Propagators, Practical Aspects of Declarative Languages
DOI : 10.1007/978-3-642-11503-5_19

H. R. , E. G. Buchanan-b, . Ed, W. Ijcai, and . Kaufmann, Increasing Tree Search Efficiency for Constraint Satisfaction Problems, pp.356-364, 1979.

V. Hentenryck and P. , Constraint satisfaction in logic programming, 1989.

H. F. Lorca-x, M. Muller-g, and L. J. , Entropy: a consolidation manager for clusters, VEE '09: Proceedings of the 2009 ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, pp.41-50, 2009.

H. F. and D. S. Lorca-x, Bin Repacking Scheduling in Virtualized Datacenters, Principles and Practice of Constraint Programming, pp.27-41, 2011.

. W. Van-hoeve, The alldifferent Constraint: A Survey, CoRR, vol.cs, 2001.

I. G. and L. L. Santaroni-f, Finding Strong Bridges and Strong Articulation Points in Linear Time, International Conference on Combinatorial Optimization and Applications, 2010.

. N. Jussien and . Lhomme-o, Dynamic domain splitting for numeric CSPs, European Conference on Artificial Intelligence (ECAI'98), pp.224-228, 1998.

. N. Jussien and . Barichard-v, The PaLM system: explanation-based constraint programming, Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, pp.118-133, 2000.

. N. Jussien, . Debruyne-r, and . Boizumault-p, Maintaining Arc-Consistency within Dynamic Backtracking, Principles and Practice of Constraint Programming, n ? 1894Lecture Notes in Computer Science, pp.249-261, 2000.
DOI : 10.1007/3-540-45349-0_19
URL : https://hal.archives-ouvertes.fr/hal-00869126

J. N. Jussien and . Lhomme-o, Local search with constraint propagation and??conflict-based heuristics, Artificial Intelligence, vol.139, issue.1, pp.21-45, 2002.
DOI : 10.1016/S0004-3702(02)00221-7
URL : https://hal.archives-ouvertes.fr/hal-00869124

. G. Katsirelos and W. T. Narodytska-n, The SeqBin Constraint Revisited, Principles and Practice of Constraint Programming, pp.332-347, 2012.
DOI : 10.1007/978-3-642-33558-7_26

L. F. Le and . Ocre, Choco : implémentation du noyau d'un système de contraintes, Actes des 6e Journées Nationales sur la résolution de Problèmes NP-Complets, pp.151-165, 2000.

M. Z. Lagerkvist and . Schulte-c, Advisors for Incremental Propagation, Principles and Practice of Constraint Programming, pp.409-422, 2007.
DOI : 10.1007/978-3-540-74970-7_30

L. M. Schulte-c, Propagator Groups, Principles and Practice of Constraint Programming, pp.524-538, 2009.

. C. Lecoutre, . Boussemart-f, and . Hemery-f, Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms, Principles and Practice of Constraint Programming, pp.480-494, 2003.
DOI : 10.1007/978-3-540-45193-8_33

. C. Lecoutre, . Hemery-f, . Lecoutre-c, and . M. Samy-modeliar, Contrôle statistique du processus de propagation de contraintes, 7ièmes Journées Francophones de Programmation par Contraintes (JFPC'11), pp.65-74, 2011.

M. A. Freuder-e, The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems, Artif. Intell, vol.25, issue.1, pp.65-74, 1985.

M. L. Hentenryck-p, Activity-Based Search for Black-Box Constraint Programming Solvers, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pp.228-243, 2012.

. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

N. Nethercote, . J. Stuckey-p, . Becket-r, . Brand-s, . J. Duck-g et al., MiniZinc: Towards a Standard CP Modelling Language, Principles and Practice of Constraint Programming, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38

O. O. Stuckey-p and C. M. , Propagation via lazy clause generation, Constraints, vol.14, issue.3, pp.357-391, 2009.

P. C. Perron-l, R. , and S. P. , Robust and Parallel Solving of a Network Design Problem, Principles and Practice of Constraint Programming

P. L. and S. P. Furnon-v, Propagation Guided Large Neighborhood Search, Principles and Practice of Constraint Programming, pp.468-481, 2004.

P. G. and Q. Zanarini-a, Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems, J. Artif. Intell. Res. (JAIR), vol.43, pp.173-210, 2012.

P. T. Beldiceanu-n and . Lorca-x, A Generalized Arc-Consistency Algorithm for a Class of Counting Constraints, pp.643-648, 2011.

P. C. Prud-'homme, . Lorca-x, . Douence-r, and . Jussien-n, Propagation engine prototyping with a domain specific language, Constraints, vol.19, issue.1, pp.57-76, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00867604

P. C. Prud-'homme, . Lorca-x, and . Jussien-n, Explanation-Based Large Neighborhood Search, Constraints, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01087844

. L. Quesada, Solving Constrained Graph Problems Using Reachability Constraints Based on Transitive Closure and Dominators, 2006.

. Schulte-c and . J. Stuckey-p, Efficient constraint propagation engines, ACM Transactions on Programming Languages and Systems, vol.31, issue.1, 2008.
DOI : 10.1145/1452044.1452046

S. S. Solnon-c, A global constraint for graph isomorphism problems, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pp.287-301, 2004.

H. P. Van and T. Deville-y, A Generic Arc-Consistency Algorithm and its Specializations, Artif. Intell, vol.57, pp.2-3, 1992.

V. G. Jussien-n, Constraint solving in uncertain and dynamic environments ? a survey, Constraints, vol.10, issue.3, pp.253-281, 2005.

Z. S. Devilles-y, . Solnon-c, . Sorlin-s, and . Dupont-p, Filtering for Subgraph Isomorphism, Principles and Practice of Constraint Programming, pp.728-742, 2007.