M. Abu-ata and F. F. Dragan, Metric tree-like structures in real-world networks: an empirical study, Networks, vol.18, issue.1, pp.49-68, 2016.
DOI : 10.1038/30918

H. Bodlaender, Treewidth: Characterizations, Applications, and Computations, pp.1-14, 2006.
DOI : 10.1007/11917496_1

URL : http://www.cs.uu.nl/research/techreps/repo/CS-2006/2006-041.pdf

H. L. Bodlaender and B. De-fluiter, On intervalizing k-colored graphs for DNA physical mapping, Discrete Applied Mathematics, vol.71, issue.1-3, pp.1-3, 1996.
DOI : 10.1016/S0166-218X(96)00057-1

URL : https://doi.org/10.1016/s0166-218x(96)00057-1

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.
DOI : 10.1137/15M1034039

URL : https://hal.archives-ouvertes.fr/hal-01348965

Y. Dourisboure and C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Mathematics, vol.307, issue.16, pp.2008-2029, 2007.
DOI : 10.1016/j.disc.2005.12.060

URL : https://hal.archives-ouvertes.fr/hal-00307800

F. Dragan and E. Köhler, An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs, Algorithmica, vol.7, issue.4, pp.884-905, 2014.
DOI : 10.1145/378580.378581

F. Dragan, E. Köhler, and A. Leitert, Line-distortion, bandwidth and path-length of a graph, pp.158-169, 2014.

F. F. Dragan and I. Lomonosov, On compact and efficient routing in certain graph classes, Discrete Applied Mathematics, vol.155, issue.11, pp.1458-1470, 2007.
DOI : 10.1016/j.dam.2007.03.011

G. Ducoffe, N. Legay, and N. Nisse, On the Complexity of Computing Treebreadth, IWOCA 2016 ? 27th International Workshop on Combinatorial Algorithms, pp.3-15, 2016.
DOI : 10.1007/978-3-642-31770-5_9

URL : https://hal.archives-ouvertes.fr/hal-01354996

F. Glover, Maximum matching in a convex bipartite graph, Naval Research Logistics Quarterly, vol.14, issue.3, pp.313-316, 1967.
DOI : 10.1002/nav.3800140304

M. Golumbic, H. Kaplan, and R. Shamir, Graph Sandwich Problems, Journal of Algorithms, vol.19, issue.3, pp.449-473, 1995.
DOI : 10.1006/jagm.1995.1047

URL : http://www.math.tau.ac.il/~haimk/papers/sandJ.ps

A. Leitert and F. Dragan, On Strong Tree-Breadth, International Conference on Combinatorial Optimization and Applications, pp.62-76, 2016.
DOI : 10.1137/0213035

C. Lekkeikerker and J. Boland, Representation of a finite graph by a set of intervals on the real line, Fundamenta Mathematicae, vol.51, issue.1, pp.45-64, 1962.
DOI : 10.4064/fm-51-1-45-64

D. Lokshtanov, On the complexity of computing treelength, Discrete Applied Mathematics, vol.158, issue.7, pp.820-827, 2010.
DOI : 10.1016/j.dam.2009.10.007

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3

URL : https://doi.org/10.1006/jctb.1996.0059