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

S. Arnborg, D. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

A. Berry, R. Pogorelcnik, and G. Simonet, An Introduction to Clique Minimal Separator Decomposition, Algorithms, vol.3, issue.2, pp.197-215, 2010.
DOI : 10.3390/a3020197
URL : https://hal.archives-ouvertes.fr/lirmm-00485851

H. Bodlaender, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, SIAM Journal on Computing, vol.25, issue.6, pp.1305-1317, 1996.
DOI : 10.1137/S0097539793251219

H. Bodlaender, M. Fellows, and T. Warnow, Two strikes against perfect phylogeny, ICALP'92, pp.273-283
DOI : 10.1007/3-540-55719-9_80

A. Brandstädt, F. Dragan, V. Chepoi, and V. Voloshin, Dually Chordal Graphs, SIAM Journal on Discrete Mathematics, vol.11, issue.3, pp.437-455, 1998.
DOI : 10.1137/S0895480193253415

S. Chechik, D. Larkin, L. Roditty, G. Schoenebeck, R. Tarjan et al., Better Approximation Algorithms for the Graph Diameter, ACM SODA'14, pp.1041-1052
DOI : 10.1137/1.9781611973402.78

V. Chepoi, F. Dragan, B. Estellon, M. Habib, and Y. Vaxès, Notes on diameters, centers, and approximating trees of ??-hyperbolic geodesic spaces and graphs, SCG '08, pp.59-68
DOI : 10.1016/j.endm.2008.06.046

D. Coudert, G. Ducoffe, and N. Nisse, Diameter of Minimal Separators in Graphs, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088423

F. De-montgolfier, M. Soto, and L. Viennot, Treewidth and Hyperbolicity of the Internet, 2011 IEEE 10th International Symposium on Network Computing and Applications, pp.25-32, 2011.
DOI : 10.1109/NCA.2011.11
URL : https://hal.archives-ouvertes.fr/hal-00909736

Y. Dourisboure, F. Dragan, C. Gavoille, and Y. Chenyu, Spanners for bounded tree-length graphs, Theoretical Computer Science, vol.383, issue.1, pp.34-44, 2007.
DOI : 10.1016/j.tcs.2007.03.058
URL : https://hal.archives-ouvertes.fr/hal-00369676

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.1007/s00453-013-9765-4

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

F. Dragan and A. Leitert, On the Minimum Eccentricity Shortest Path Problem, Algorithms and Data Structures ? WADS, pp.276-288, 2015.
DOI : 10.1007/978-3-319-21840-3_23

G. Ducoffe, S. Legay, and N. Nisse, On computing tree and path decompositions with metric constraints on the bags, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01254917

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

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. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4
URL : http://doi.org/10.1006/jctb.1999.1919

C. Wang, T. Liu, W. Jiang, and K. Xu, Feedback Vertex Sets on Tree Convex Bipartite Graphs, COCOA 2012, pp.95-102, 2012.
DOI : 10.1007/978-3-642-31770-5_9

Y. Wu, P. Austrin, T. Pitassi, and D. Liu, Inapproximability of treewidth and related problems, J. Artif. Intell. Res. (JAIR), vol.49, pp.569-600, 2014.