S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of Finding Embeddings in a k-Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.

R. Belmonte, F. V. Fomin, P. A. Golovach, and M. S. Ramanujan, Metric Dimension of Bounded Tree-length Graphs, SIAM Journal on Discrete Mathematics, vol.31, issue.2, pp.1217-1243, 2017.

H. L. Bodlaender, M. Cygan, S. Kratsch, and J. Nederlof, Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth, Information and Computation, vol.243, pp.86-111, 2015.

H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov et al., A $c^k n$ 5-Approximation Algorithm for Treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016.

H. L. Bodlaender, F. V. Fomin, D. Lokshtanov, E. Penninkx, S. Saurabh et al., (Meta) Kernelization, Journal of the ACM, vol.63, issue.5, pp.1-69, 2016.
URL : https://hal.archives-ouvertes.fr/lirmm-01483628

H. L. Bodlaender and T. Kloks, Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs, Journal of Algorithms, vol.21, issue.2, pp.358-402, 1996.

D. Coudert, G. Ducoffe, and N. Nisse, To Approximate Treewidth, Use Treelength!, SIAM Journal on Discrete Mathematics, vol.30, issue.3, pp.1424-1436, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01348965

B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs, Theoretical Computer Science, vol.109, issue.1-2, pp.49-82, 1993.

M. Cygan, F. V. Fomin, ?. Kowalik, D. Lokshtanov, D. Marx et al., Advanced kernelization algorithms, Parameterized Algorithms, pp.285-319, 2015.

E. D. Demaine and M. Hajiaghayi, The Bidimensionality Theory and Its Algorithmic Applications, The Computer Journal, vol.51, issue.3, pp.292-302, 2007.

Y. Dieng and C. Gavoille, On the Tree-Width of Planar Graphs, Electronic Notes in Discrete Mathematics, vol.34, pp.593-596, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00408481

R. Diestel, Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017.

Y. Dourisboure and C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16, pp.2008-2029, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00307800

F. F. Dragan and E. Köhler, An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs, Algorithmica, vol.69, issue.4, pp.884-905, 2013.

G. Ducoffe, S. Legay, and N. Nisse, On the Complexity of Computing Treebreadth, Algorithmica, vol.82, issue.6, pp.1574-1600, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02528905

D. Eppstein, Parallel recognition of series-parallel graphs, Information and Computation, vol.98, issue.1, pp.41-55, 1992.

U. Feige, M. T. Hajiaghayi, and J. R. Lee, Improved Approximation Algorithms for Minimum Weight Vertex Separators, SIAM Journal on Computing, vol.38, issue.2, pp.629-657, 2008.

R. Halin, S-functions for graphs, Journal of Geometry, vol.8, issue.1-2, pp.171-186, 1976.

F. Kammer and T. Tholey, Approximate tree decompositions of planar graphs in linear time, Theoretical Computer Science, vol.645, pp.60-90, 2016.

A. Kosowski, B. Li, N. Nisse, and K. Suchan, k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth, Algorithmica, vol.72, issue.3, pp.758-777, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00671861

R. Krauthgamer and J. R. Lee, Algorithms on negatively curved spaces, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.119-132, 2006.

D. Lokshtanov, On the complexity of computing treelength, Discrete Applied Mathematics, vol.158, issue.7, pp.820-827, 2010.

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.

P. D. Seymour and R. Thomas, Call routing and the ratcatcher, Combinatorica, vol.14, issue.2, pp.217-241, 1994.

J. Valdes, R. E. Tarjan, and E. L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing, vol.11, issue.2, pp.298-313, 1982.