V. Bertele and F. Brioschi, Nonserial Dynamic Programming, 1972.

N. Robertson and P. Seymour, Graph minors II: Algorithmic aspects of treewidth, Algorithms, vol.7, pp.309-322, 1986.

R. Dechter, Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms, 2013.

, Constraint processing, 2003.

S. Arnborg, D. Corneil, and A. Proskuroswki, Complexity of finding embeddings in a k-tree, SIAM Journal of Disc. Math, vol.8, pp.277-284, 1987.

D. J. Rose, A graph theoretic study of the numerical solution of sparse positive definite systems of linear equations, Graph Theory and Computing, pp.183-217, 1972.

U. Kjaerulff, Triangulation of Graphs-Algorithms Giving Small Total State Space, Judex R.R. Aalborg, 1990.

R. Tarjan and M. Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.

P. Jégou, H. Kanso, and C. Terrioux, An Algorithmic Framework for Decomposing Constraint Networks, ICTAI, pp.1-8, 2015.

H. Dell, C. Komusiewicz, N. Talmon, and M. Weller, The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration, IPEC, vol.30, p.12, 2018.

G. Gottlob, N. Leone, and F. Scarcello, A Comparison of Structural CSP Decomposition Methods, AIJ, vol.124, pp.243-282, 2000.

M. Abseher, N. Musliu, and S. Woltran, Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning, JAIR, vol.58, pp.829-858, 2017.

P. Jégou and C. Terrioux, Hybrid backtracking bounded by treedecomposition of constraint networks, AIJ, vol.146, pp.43-75, 2003.

R. Dechter and R. Mateescu, The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting, CP, pp.731-736, 2004.

S. De-givry, T. Schiex, and G. Verfaillie, Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP, AAAI, pp.22-27, 2006.

B. Hurley, B. O'sullivan, D. Allouche, G. Katsirelos, T. Schiex et al., Multi-language evaluation of exact solvers in graphical model discrete optimization, Constraints, vol.21, issue.3, pp.413-434, 2016.

A. Koster, Frequency Assignment-Models and Algorithms, 1999.

K. Shoikhet and D. Geiger, A practical algorithm for finding optimal triangulation, pp.185-190, 1997.

V. Gogate and R. Dechter, A complete anytime algorithm for treewidth, UAI, pp.201-208, 2004.

H. L. Bodlaender, F. V. Fomin, A. M. Koster, D. Kratsch, and D. M. Thilikos, On exact algorithms for treewidth, ACM Trans. Algorithms, vol.9, issue.1, pp.1-12, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00804792

P. Jégou, H. Kanso, and C. Terrioux, Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size, CP, pp.298-315, 2016.

F. Boussemart, C. Lecoutre, and C. Piette, XCSP3: an integrated format for benchmarking combinatorial constrained problems, CoRR, 2016.

P. Jégou and C. Terrioux, Combining restarts, nogoods and bagconnected decompositions for solving CSPs, Constraints, vol.22, issue.2, pp.191-229, 2017.

P. Jégou, H. Kanso, and C. Terrioux, BTD and miniBTD, XCSP3 Competition, 2017.