Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987. ,
Characterization and recognition of partial 3-trees, SIAM J. Algebraic Discrete Methods, vol.7, issue.2, pp.305-314, 1986. ,
A c k n 5-approximation algorithm for treewidth, SIAM J. Comput, vol.45, issue.2, pp.317-378, 2016. ,
Subexponential time algorithms for finding small tree and path decompositions, 23rd Annual European Symposium on Algorithms (ESA 2015) (2015), pp.179-190 ,
The bidimensionality theory and its algorithmic applications, Comput. J, vol.51, issue.3, pp.292-302, 2008. ,
The complexity of minimum-length path decompositions, J. Comput. Syst. Sci, vol.81, issue.8, pp.1715-1747, 2015. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Algorithm 447: efficient algorithms for graph manipulation, Commun. ACM, vol.16, issue.6, pp.372-378, 1973. ,
Characterization of partial 3-trees in terms of three structures, Graphs and Combinatorics, vol.2, issue.1, pp.233-246, 1986. ,
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
Algorithms finding tree-decompositions of graphs, Journal of Algorithms, vol.12, issue.1, pp.1-22, 1991. ,
Graph minors. II. algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986. ,
Steiner trees, partial 2-trees, and minimum ifi networks, pp.159-167, 1983. ,