-Tree, PODC, pp.277-284, 1987. ,
DOI : 10.1137/0608024
On space-stretch trade-offs, Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures , SPAA '06, pp.217-224, 2006. ,
DOI : 10.1145/1148109.1148143
URL : https://hal.archives-ouvertes.fr/hal-00371404
Routing in Networks with Low Doubling Dimension, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), p.75, 2006. ,
DOI : 10.1109/ICDCS.2006.72
URL : https://hal.archives-ouvertes.fr/hal-00400501
Compact name-independent routing with minimum stretch Efficient and constructive algorithms for the pathwidth and treewidth of graphs The game of Cops and Robber on Graphs, ACM T. Alg. J. Algorithms, vol.4, issue.212, pp.358-402, 1996. ,
A partial k-arboretum of graphs with bounded treewidth, Disc. Ap. Maths CCCCM93] B. Courcelle and M. Mosbah Dourisboure and C. Gavoille. Tree-decompositions with bags of small diameter. Discrete Mathematics, pp.1-4545, 1993. ,
DOI : 10.1016/S0304-3975(97)00228-4
Treewidth and hyperbolicity of the internet Compact routing schemes for generalised chordal graphs, NCA, pp.25-32277, 2005. ,
Routing in trees Hyperbolic groups. Essays in Group Theory Algorithms for finding an induced cycle in planar graphs and bounded genus graphs, 20th Annual ACM- SIAM Symp. on Discrete Alg. (SODA), pp.757-77275, 1987. ,
k-chordal graphs: from cops and robber to compact routing via treewidth, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00687120
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
Distributed computing of efficient routing schemes in generalized chordal graphs. TCS, 2012. To appear Collective dynamics of 'small-world' networks Hyperbolicity and chordality of a graph, Nature Electr. J. Comb, vol.393, issue.181, pp.440-442, 1998. ,
URL : https://hal.archives-ouvertes.fr/inria-00423454