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. V. Goldberg, and D. Malkhi, 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

B. Awerbuch, D. Peleg, [. Barabasi, R. A. Albert, R. Berry et al., Network synchronization with polylogarithmic overhead Emergence of scaling in random networks Ultimate generalizations of lexbfs and lex m, Proceedings of the 31st IEEE Symposium on Foundations of Computer Science (FOCS) Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.514-522509, 1990.

G. Derek, R. M. Corneil, and . Krueger, A unified view of graph searching, SIAM Journal on Discrete Mathematics, vol.22, issue.4, pp.1259-1276, 2008.

Y. Dourisboure and C. Gavoille, Improved compact routing scheme for chordal graphs Compact routing schemes for generalised chordal graphs, Proceedings of the 16th International Conference on Distributed Computing (DISC), pp.252-264277, 2002.
DOI : 10.7155/jgaa.00109
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.5320

]. F. Dra05 and . Dragan, Estimating all pairs shortest paths in restricted graph families: a unified approach, Journal of Algorithms, vol.57, issue.1, pp.1-21, 2005.

O. [. Fulkerson and . Gross, Incidence matrices and interval graphs, Pacific Journal of Mathematics, vol.15, issue.3, pp.835-855, 1965.
DOI : 10.2140/pjm.1965.15.835
URL : http://projecteuclid.org/download/pdf_1/euclid.pjm/1102995572

P. Fraigniaud and C. Gavoille, Routing in Trees, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp.757-772, 2001.
DOI : 10.1007/3-540-48224-5_62
URL : https://hal.archives-ouvertes.fr/hal-00307398

]. P. Fra05 and . Fraigniaud, Greedy routing in tree-decomposed graphs, Proceedings of the 13th Annual European Symposium on Algorithms (ESA), pp.791-802, 2005.

]. C. Gav00 and . Gavoille, A survey on interval routing, Theoretical Computer Science, vol.245, issue.2, pp.217-253, 2000.

C. Gavoille and M. Gengler, Space-Efficiency for Routing Schemes of Stretch Factor Three, Journal of Parallel and Distributed Computing, vol.61, issue.5, pp.679-687, 2001.
DOI : 10.1006/jpdc.2000.1705

]. M. Gol04 and . Golumbic, Algorithmic Graph Theory and Perfect Graphs, 2004.

C. Gavoille and S. Perennes, Memory requirements for routing in distributed networks (extended abstract), Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp.125-133, 1996.

C. Gavoille and D. Peleg, The Compactness of Interval Routing, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.459-473, 1999.
DOI : 10.1137/S0895480197328631

C. Gavoille and D. Peleg, The Compactness of Interval Routing for Almost All Graphs, SIAM Journal on Computing, vol.31, issue.3, pp.706-721, 2001.
DOI : 10.1137/S0097539799351717

L. Hogie, D. Papadimitriou, and I. Tahiri, Alusim: simulating routing schemes on large-scale topologies, 2009.
DOI : 10.1109/pads.2010.5471662
URL : https://hal.inria.fr/inria-00440114/document

L. Narayanan and N. Nishimura, Interval Routing onk-Trees, Journal of Algorithms, vol.26, issue.2, pp.325-369, 1998.
DOI : 10.1006/jagm.1997.0880
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.7005

D. Peleg and E. Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM, vol.36, issue.3, pp.510-530, 1989.
DOI : 10.1145/65950.65953

R. [. Santoro and . Khatib, Labelling and Implicit Routing in Networks, The Computer Journal, vol.28, issue.1, pp.5-8, 1985.
DOI : 10.1093/comjnl/28.1.5

M. Thorup, Compact oracles for reachability and approximate distances in planar digraphs, Journal of the ACM, vol.51, issue.6, pp.993-1024, 2004.
DOI : 10.1145/1039488.1039493

U. [. Thorup and . Zwick, Compact routing schemes, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures , SPAA '01, pp.1-10, 2001.
DOI : 10.1145/378580.378581