{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T02:08:19Z","timestamp":1780538899438,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291633","type":"print"},{"value":"9783540320753","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_32","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T10:14:47Z","timestamp":1128939287000},"page":"442-456","source":"Crossref","is-referenced-by-count":23,"title":["Compact Routing for Graphs Excluding a Fixed Minor"],"prefix":"10.1007","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-30186-8_22","volume-title":"Distributed Computing","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 305\u2013319. Springer, Heidelberg (2004)"},{"key":"32_CR2","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. Tech. Report RR-1330-04, LaBRI, University of Bordeaux 1, 351, cours de la Liberation, 33405 Talence Cedex, France (July 2004)"},{"key":"32_CR3","volume-title":"16th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA)","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: 16th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA). ACM PRESS, New York (2004)"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/1011767.1011789","volume-title":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC)","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Malkhi, D.: Compact routing on euclidian metrics. In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC), pp. 141\u2013149. ACM Press, New York (2004)"},{"key":"32_CR5","volume-title":"17th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA)","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: 17th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), ACM Press, New York (2005) (to appear)"},{"key":"32_CR6","first-page":"503","volume-title":"31st Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503\u2013513. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0405013","volume":"5","author":"B. Awerbuch","year":"1992","unstructured":"Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. Discret. Math.\u00a05, 151\u2013162 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Competitive online routing in geometric graphs. Theoretical Computer Science\u00a0324, 273\u2013288 (2004)","journal-title":"Theoretical Computer Science"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P. Bose","year":"2004","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. SIAM Journal on Computing\u00a033, 937\u2013951 (2004)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR10","unstructured":"Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: 16th Symposium on Discrete Algorithms (SODA), January 2005. ACM\/SIAM (2005)"},{"key":"32_CR11","unstructured":"Chepoi, V.D., Dragan, F.F., Vaxes, Y.: Distance and routing labeling schemes for non-positively curved plane graphs. Journal of Algorithms (2004) (to appear)"},{"key":"32_CR12","unstructured":"Chepoi, V.D., Rollin, A.: Interval routing in some planar quadrangulations. In: 8th International Colloquium on Structural Information & Communication Complexity (SIROCCO), June 2001, pp. 89\u2013104. Carleton Scientific (2001)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jctb.2003.09.001","volume":"91","author":"M. DeVos","year":"2004","unstructured":"DeVos, M., Ding, G., Oporowski, B., Sanders, D.P., Reed, B., Seymour, P.D., Vertigan, D.: Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory, Series B\u00a091, 25\u201341 (2004)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-540-30186-8_26","volume-title":"Distributed Computing","author":"Y. Dourisboure","year":"2004","unstructured":"Dourisboure, Y.: Compact routing schemes for bounded tree-length graphs and for k-chordal graphs. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 365\u2013378. Springer, Heidelberg (2004)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-36108-1_17","volume-title":"Distributed Computing","author":"Y. Dourisboure","year":"2002","unstructured":"Dourisboure, Y., Gavoille, C.: Improved compact routing scheme for chordal graphs. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 252\u2013264. Springer, Heidelberg (2002)"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-540-30551-4_36","volume-title":"Algorithms and Computation","author":"F.F. Dragan","year":"2004","unstructured":"Dragan, F.F., Lomonosov, I.: On compact and efficient routing in certain graph classes. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 402\u2013414. Springer, Heidelberg (2004)"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0196-6774(03)00002-6","volume":"46","author":"T. Eilam","year":"2003","unstructured":"Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. Journal of Algorithms\u00a046, 97\u2013114 (2003)","journal-title":"Journal of Algorithms"},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00224-002-1033-y","volume":"36","author":"P. Flocchini","year":"2003","unstructured":"Flocchini, P., Luccio, F.L.: Routing in series parallel networks. Theory Comput. Syst.\u00a036, 137\u2013157 (2003)","journal-title":"Theory Comput. Syst."},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/0218058","volume":"18","author":"G.N. Frederickson","year":"1989","unstructured":"Frederickson, G.N., Janardan, R.: Efficient message routing in planar networks. SIAM Journal on Computing\u00a018, 843\u2013857 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/568438.568451","volume":"32","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column\u00a032, 36\u201352 (2001)","journal-title":"ACM SIGACT News - Distributed Computing Column"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-48523-6_32","volume-title":"Automata, Languages and Programming","author":"C. Gavoille","year":"1999","unstructured":"Gavoille, C., Hanusse, N.: Compact routing tables for graphs of bounded genus. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 351\u2013360. Springer, Heidelberg (1999)"},{"key":"32_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Journal of Distributed Computing\u00a016, 111\u2013120 (2003) PODC 20-Year Issue","journal-title":"Journal of Distributed Computing"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9renn\u00e8s, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms\u00a053, 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"key":"32_CR24","first-page":"534","volume-title":"44th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 534\u2013543. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"32_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s004460100054","volume":"14","author":"Y. Hassin","year":"2001","unstructured":"Hassin, Y., Peleg, D.: Sparse communication networks and efficient routing in the plane. Distributed Computing\u00a014, 205\u2013215 (2001)","journal-title":"Distributed Computing"},{"key":"32_CR26","first-page":"682","volume-title":"25th Annual ACM Symposium on Theory of Computing (STOC)","author":"P. Klein","year":"1993","unstructured":"Klein, P., Plotkin, S.A., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: 25th Annual ACM Symposium on Theory of Computing (STOC), pp. 682\u2013690. ACM Press, New York (1993)"},{"key":"32_CR27","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/1011767.1011841","volume-title":"24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"K.A. Laing","year":"2004","unstructured":"Laing, K.A.: Brief announcement: name-independent compact routing in trees. In: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 382\u2013382. ACM Press, New York (2004)"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45655-4_8","volume-title":"Computing and Combinatorics","author":"H.-I. Lu","year":"2002","unstructured":"Lu, H.-I.: Improved compact routing tables for planar networks via orderly spanning trees. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 57\u201366. Springer, Heidelberg (2002)"},{"key":"32_CR29","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"36","author":"C.S.J. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.S.J.: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc.\u00a036, 445\u2013450 (1961)","journal-title":"J. London Math. Soc."},{"key":"32_CR30","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"32_CR31","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. Journal of Graph Theory\u00a033, 167\u2013176 (2000)","journal-title":"Journal of Graph Theory"},{"key":"32_CR32","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. Journal of the ACM\u00a036, 510\u2013530 (1989)","journal-title":"Journal of the ACM"},{"key":"32_CR33","volume-title":"24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"A. Slivkins","year":"2005","unstructured":"Slivkins, A.: Distance estimation and object location via rings of neighbors. In: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM Press, New York (2005) (to appear), Also appears as Cornell CIS technical report TR2005-1977"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: Algorithms for low dimensional metrics. In: 36th Annual ACM Symposium on Theory of Computing (STOC), June 2004, pp. 281\u2013290 (2004)","DOI":"10.1145\/1007352.1007399"},{"key":"32_CR35","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/SFCS.2001.959898","volume-title":"42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. In: 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 242\u2013251. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"32_CR36","first-page":"1","volume-title":"13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201310. ACM Press, New York (2001)"},{"key":"32_CR37","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Englewood Cliffs (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T09:19:56Z","timestamp":1626599996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_32"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11561927_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}