N. Beldiceanu, P. Flener, and X. Lorca, The tree Constraint, CP-AI-OR'05, pp.64-78, 2005.
DOI : 10.1007/11493853_7
URL : https://hal.archives-ouvertes.fr/hal-00445174

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

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007.
DOI : 10.1007/s10601-006-9010-8

N. Beldiceanu, M. Carlsson, and T. Petit, Deriving Filtering Algorithms from Constraint Checkers, CP'04, pp.107-122, 2004.
DOI : 10.1007/978-3-540-30201-8_11

N. Beldiceanu, M. Carlsson, E. Poder, R. Sadek, and C. Truchet, A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects, CP'07, pp.180-194, 2007.
DOI : 10.1007/978-3-540-74970-7_15
URL : https://hal.archives-ouvertes.fr/hal-00481558

C. Bessière and P. Van-hentenryck, To Be or Not to Be ... a Global Constraint, CP'03, pp.789-794, 2003.
DOI : 10.1007/978-3-540-45193-8_54

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

Y. Pham-quang-dung, P. Deville, and . Van-hentenryck, Ls(graph) : A local search framework for constraint optimization on graphs and trees, SAC, 2009.

D. Eppstein, Z. Galil, and G. Italiano, Dynamic Graph Algorithms, 1997.
DOI : 10.1201/9781420049503-c9

N. Jussien and V. Barichard, The PaLM system : explanationbased constraint programming, Proceedings of TRICS workshop of CP, pp.118-133, 2000.

Z. Mikael, C. Lagerkvist, and . Schulte, Advisors for incremental propagation, CP'07, pp.409-422, 2007.

J. Laurière, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

A. López-ortiz, C. Quimper, J. Tromp, and P. Van-beek, A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint, IJCAI, pp.245-250, 2003.

R. Mohr and T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4
URL : https://hal.archives-ouvertes.fr/inria-00548487

J. Régin, A filtering algorithm for constraints of difference in CSP, AAAI'94, pp.362-367, 1994.

J. Régin, Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost, CP, pp.520-533, 2005.
DOI : 10.1007/11564751_39

J. Régin, Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint, CPAIOR'08, pp.233-247, 2008.
DOI : 10.1007/978-3-540-68155-7_19

C. Schulte, Comparing Trailing and Copying for Constraint Programming, ICLP'99, pp.275-289, 1999.

V. C. Sreedhar, G. R. Gao, and Y. Lee, Incremental computation of dominator trees, ACM Transactions on Programming Languages and Systems, vol.19, issue.2, pp.239-252, 1997.
DOI : 10.1145/244795.244799

P. Van-hentenryck, Constraint satisfaction in logic programming, 1989.

P. Van, H. , and L. Michel, Growing COMET, Trends in Constraint Programming, pp.291-297, 2007.

W. J. Van-hoeve, The alldifferent constraint : A survey. CoRR, cs, 2001.

S. Wilson and J. Kesselman, Java Platorm Performance : Strategies and Tactics, 2000.