I. Abraham and C. Gavoille, Object location using path separators, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.188-197, 2006.
DOI : 10.1145/1146381.1146411
URL : https://hal.archives-ouvertes.fr/hal-00400425

I. Abraham, C. Gavoille, A. Goldberg, and D. Malkhi, Routing in Networks with Low Doubling Dimension, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), pp.75-75, 2006.
DOI : 10.1109/ICDCS.2006.72
URL : https://hal.archives-ouvertes.fr/hal-00400501

I. Abraham, C. Gavoille, and D. Malkhi, Compact Routing for Graphs Excluding a Fixed Minor, Distributed Computing, pp.442-456, 2005.
DOI : 10.1007/11561927_32
URL : https://hal.archives-ouvertes.fr/hal-00378466

I. Abraham, C. Gavoille, and D. Malkhi, On space-stretch trade-offs, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.207-216, 2006.
DOI : 10.1145/1148109.1148143
URL : https://hal.archives-ouvertes.fr/hal-00371404

I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup, Compact name-independent routing with minimum stretch, ACM Transactions on Algorithms, vol.4, issue.3, pp.1-3712, 2008.
DOI : 10.1145/1367064.1367077
URL : https://hal.archives-ouvertes.fr/hal-00307619

I. Abraham and D. Malkhi, Name independent routing for growth bounded networks, Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures , SPAA'05, pp.49-55, 2005.
DOI : 10.1145/1073970.1073978

M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, pp.1-12, 1984.
DOI : 10.1016/0166-218X(84)90073-8

A. G. Aksoy and S. Jin, The apple doesn't fall far from the (metric) tree: The equivalence of definitions, 2013.

T. Andreae, On a pursuit game played on graphs for which a minor is excluded, Journal of Combinatorial Theory, Series B, vol.41, issue.1, pp.37-47, 1986.
DOI : 10.1016/0095-8956(86)90026-2

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

H. Bandelt and V. Chepoi, 1-Hyperbolic Graphs, SIAM Journal on Discrete Mathematics, vol.16, issue.2, pp.323-334, 2003.
DOI : 10.1137/S0895480100380902

H. L. 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. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998.
DOI : 10.1016/S0304-3975(97)00228-4

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.
DOI : 10.1006/jagm.1996.0049

H. L. Bodlaender and R. Mhring, The Pathwidth and Treewidth of Cographs, SIAM Journal on Discrete Mathematics, vol.6, issue.2, pp.181-188, 1993.
DOI : 10.1137/0406014

H. L. Bodlaender and D. M. Thilikos, Treewidth for graphs with small chordality, Discrete Applied Mathematics, vol.79, issue.1-3, pp.45-61, 1997.
DOI : 10.1016/S0166-218X(97)00031-0
URL : http://doi.org/10.1016/s0166-218x(97)00031-0

A. Bonato and R. Nowakovski, The game of Cops and Robber on Graphs, 2011.
DOI : 10.1090/stml/061

L. Cai, S. M. Chan, and S. O. Chan, Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems, Proceedings 2nd International Workshop on Parameterized and Exact Computation, pp.239-250, 2006.
DOI : 10.1007/11847250_22

J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxs, Cop and Robber Games When the Robber Can Hide and Ride, SIAM Journal on Discrete Mathematics, vol.25, issue.1, pp.333-359, 2011.
DOI : 10.1137/100784035
URL : https://hal.archives-ouvertes.fr/inria-00482117

W. Chen, C. Sommer, S. H. Teng, and Y. Wang, Compact Routing in Power-Law Graphs, Distributed Computing, pp.379-391, 2009.
DOI : 10.1007/978-3-642-04355-0_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.9735

Y. Chen and J. Flum, On Parameterized Path and Chordless Path Problems, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), pp.250-263, 2007.
DOI : 10.1109/CCC.2007.21

V. Chepoi, F. Dragan, B. Estellon, M. Habib, and Y. Vaxès, Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, pp.59-68, 2008.
DOI : 10.1145/1377676.1377687

V. Chepoi, F. Dragan, B. Estellon, M. Habib, Y. Vaxs et al., Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs, Algorithmica, vol.52, issue.3-4, pp.3-4, 2012.
DOI : 10.1007/s00453-010-9478-x
URL : https://hal.archives-ouvertes.fr/hal-01194836

N. E. Clarke and R. J. Nowakowski, Tandem-win graphs, Discrete Mathematics, vol.299, issue.1-3, pp.56-64, 2005.
DOI : 10.1016/j.disc.2004.11.016
URL : http://doi.org/10.1016/j.disc.2004.11.016

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.
DOI : 10.1016/0304-3975(93)90064-Z
URL : http://doi.org/10.1016/0304-3975(93)90064-z

Y. Dourisboure, Compact Routing Schemes for Generalised Chordal Graphs, Journal of Graph Algorithms and Applications, vol.9, issue.2, pp.277-297, 2005.
DOI : 10.7155/jgaa.00109

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

P. Fraigniaud and C. Gavoille, Routing in Trees, In: Automata, Languages and Programming Lecture Notes in Computer Science, vol.2076, pp.757-772, 2001.
DOI : 10.1007/3-540-48224-5_62
URL : https://hal.archives-ouvertes.fr/hal-00307398

P. Frankl, Cops and robbers in graphs with large girth and Cayley graphs, Discrete Applied Mathematics, vol.17, issue.3, pp.301-305, 1987.
DOI : 10.1016/0166-218X(87)90033-3
URL : http://doi.org/10.1016/0166-218x(87)90033-3

M. Gromov, Hyperbolic Groups, pp.75-263, 1987.
DOI : 10.1007/978-1-4613-9586-7_3

J. Hopcroft and R. Tarjan, Algorithm 447: efficient algorithms for graph manipulation, Communications of the ACM, vol.16, issue.6, pp.372-378, 1973.
DOI : 10.1145/362248.362272

T. Kloks and D. Kratsch, Treewidth of Chordal Bipartite Graphs, Journal of Algorithms, vol.19, issue.2, pp.266-281, 1995.
DOI : 10.1006/jagm.1995.1037

Y. Kobayashi and K. I. Kawarabayashi, Algorithms for Finding an Induced Cycle in Planar Graphs and Bounded Genus Graphs, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '09, pp.1146-1155, 2009.
DOI : 10.1137/1.9781611973068.124

G. Konjevod, A. W. Richa, and D. Xia, Optimal-stretch name-independent compact routing in doubling metrics, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.198-207, 2006.
DOI : 10.1145/1146381.1146412

A. Kosowski, B. Li, N. Nisse, and K. Suchan, k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth, Automata, Languages, and Programming, pp.610-622, 2012.
DOI : 10.1007/978-3-642-31585-5_54
URL : https://hal.archives-ouvertes.fr/hal-00687120

D. Krioukov, F. Papadopoulos, M. Boguñá, and A. Vahdat, Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces, ACM SIGMETRICS Performance Evaluation Review, vol.37, issue.2, pp.15-17, 2009.
DOI : 10.1145/1639562.1639568

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

L. Lu and X. Peng, On Meyniel's conjecture of the cop number, Journal of Graph Theory, vol.38, issue.3, pp.192-205, 2012.
DOI : 10.1002/jgt.20642

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

N. Nisse, I. Rapaport, and K. Suchan, Distributed computing of efficient routing schemes in generalized chordal graphs, Theoretical Computer Science, vol.444, issue.0, pp.17-27, 2012.
DOI : 10.1016/j.tcs.2012.01.006
URL : https://hal.archives-ouvertes.fr/inria-00423454

R. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2-3, pp.235-239, 1983.
DOI : 10.1016/0012-365X(83)90160-7

T. Opsahl and P. Panzarasa, Clustering in weighted networks, Social Networks, vol.31, issue.2, pp.155-163, 2009.
DOI : 10.1016/j.socnet.2009.02.002

A. Quilliot, A short note about pursuit games played on a graph with a given genus, Journal of Combinatorial Theory, Series B, vol.38, issue.1, pp.89-92, 1985.
DOI : 10.1016/0095-8956(85)90093-0

N. Robertson and P. 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 : http://doi.org/10.1006/jctb.1999.1919

B. S. Schröder, The Copnumber of a Graph is Bounded by [3/2 genus (G)] + 3, In: Categorical Perspectives, Trends in Mathematics Birkhuser Boston, pp.243-263, 2001.
DOI : 10.1007/978-1-4612-1370-3_14

A. Scott and B. Sudakov, A Bound for the Cops and Robbers Problem, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1438-1442, 2011.
DOI : 10.1137/100812963

R. Sundaram, K. Singh, and C. Rangan, Treewidth of Circular-Arc Graphs, SIAM Journal on Discrete Mathematics, vol.7, issue.4, pp.647-655, 1994.
DOI : 10.1137/S0895480191193789

R. Uehara, Tractable and intractable problems on generalized chordal graphs, IEICE, 1999.

D. J. Watts and S. Strogatz, Collective dynamics of 'small-world' networks, Nature, vol.393, issue.6684, pp.440-442, 1998.
DOI : 10.1038/30918

Y. Wu and C. Zhang, Hyperbolicity and chordality of a graph, Electronic Journal of Combinatorics, vol.18, issue.1, 2011.