A. , S. Corneil, D. G. And-proskurowski, and A. , Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.

A. , S. And-proskurowski, and A. , Characterization and recognition of partial 3-trees, SIAM J. Algebraic Discrete Methods, vol.7, issue.2, pp.305-314, 1986.

B. , H. L. Drange, P. G. Dregi, M. S. Fomin, F. V. Lok-shtanov et al., A c k n 5-approximation algorithm for treewidth, SIAM J. Comput, vol.45, issue.2, pp.317-378, 2016.

B. , H. L. And-nederlof, and J. , Subexponential time algorithms for finding small tree and path decompositions, 23rd Annual European Symposium on Algorithms (ESA 2015) (2015), pp.179-190

D. , E. D. And-hajiaghayi, and M. , The bidimensionality theory and its algorithmic applications, Comput. J, vol.51, issue.3, pp.292-302, 2008.

D. , D. Kubiak, W. And-zwols, and Y. , The complexity of minimum-length path decompositions, J. Comput. Syst. Sci, vol.81, issue.8, pp.1715-1747, 2015.

G. , M. R. And, J. , and D. S. , Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

H. , J. And-tarjan, and R. , Algorithm 447: efficient algorithms for graph manipulation, Commun. ACM, vol.16, issue.6, pp.372-378, 1973.

K. , Y. Ishizuka, A. And-ueno, and S. , Characterization of partial 3-trees in terms of three structures, Graphs and Combinatorics, vol.2, issue.1, pp.233-246, 1986.

L. , B. Moataz, F. Z. Nisse, N. And-suchan, and K. , Minimum size treedecompositions, Proceedings of VIII Latin-American Algorithms, Graphs and Optimization Symposium, pp.21-27, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01023904

M. , J. And-thomas, and R. , Algorithms finding tree-decompositions of graphs, Journal of Algorithms, vol.12, issue.1, pp.1-22, 1991.

R. , N. And-seymour, and P. , Graph minors. II. algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.

W. , J. A. And-colbourn, and C. J. , Steiner trees, partial 2-trees, and minimum ifi networks, pp.159-167, 1983.