{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:59Z","timestamp":1750694699452},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T00:00:00Z","timestamp":1282867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s00224-010-9283-6","type":"journal-article","created":{"date-parts":[[2010,8,26]],"date-time":"2010-08-26T05:07:15Z","timestamp":1282799235000},"page":"837-855","source":"Crossref","is-referenced-by-count":15,"title":["Strong-Diameter Decompositions of Minor Free Graphs"],"prefix":"10.1007","volume":"47","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Udi","family":"Wieder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,27]]},"reference":[{"key":"9283_CR1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/1146381.1146411","volume-title":"25th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Gavoille, C.: Object location using path separators. In: 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 188\u2013197. ACM Press, New York (2006)"},{"key":"9283_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/978-3-540-30186-8_22","volume-title":"18th International Symposium on Distributed Computing (DISC)","author":"I. Abraham","year":"2004","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: 18th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol.\u00a03274, pp. 305\u2013319. Springer, Berlin (2004)"},{"key":"9283_CR3","first-page":"20","volume-title":"16th Annual ACM Symposium on Parallel Algorithms and Architectures (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 Architectures (SPAA), pp. 20\u201324. ACM Press, New York (2004)"},{"key":"9283_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/11561927_32","volume-title":"19th International Symposium on Distributed Computing (DISC)","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: 19th International Symposium on Distributed Computing (DISC). Lecture Notes in Computer Science, vol.\u00a03724, pp. 442\u2013456. Springer, Berlin (2005)"},{"key":"9283_CR5","first-page":"217","volume-title":"18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Gavoille, C., Malkhi, D.: On space-stretch trade-offs: Lower bounds. In: 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 217\u2013224. ACM Press, New York (2006)"},{"key":"9283_CR6","unstructured":"Awerbuch, B., Peleg, D.: Locality-sensitive resource allocation. Technical Report CS90-27, Weizmann Institute, November 1990"},{"key":"9283_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Network synchronization with polylogarithmic overhead. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0514\u2013522 (1990)","DOI":"10.1109\/FSCS.1990.89572"},{"key":"9283_CR8","first-page":"503","volume-title":"31th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: 31th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 503\u2013513. IEEE Computer Society Press, Los Alamitos (1990)"},{"issue":"2","key":"9283_CR9","doi-asserted-by":"crossref","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. Discrete Math. 5(2), 151\u2013162 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"9283_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/1281100.1281112","volume-title":"26th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"C. Busch","year":"2007","unstructured":"Busch, C., LaFortune, R., Tirthapura, S.: Improved sparse covers for graphs excluding a fixed minor. In: 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 61\u201370. ACM Press, New York (2007)"},{"key":"9283_CR11","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/1060590.1060665","volume-title":"STOC \u201905: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing","author":"M. Elkin","year":"2005","unstructured":"Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: STOC \u201905: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 494\u2013503. ACM Press, New York (2005)"},{"key":"9283_CR12","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol, J., Talwar, K.: An improved decomposition theorem for graphs excluding a fixed minor. In: RANDOM-APPROX, pp.\u00a036\u201346 (2003)","DOI":"10.1007\/978-3-540-45198-3_4"},{"key":"9283_CR13","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)"},{"issue":"2","key":"9283_CR14","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1006\/jctb.2000.2013","volume":"81","author":"A. Thomason","year":"2001","unstructured":"Thomason, A.: The extremal function for complete minors. J. Comb. Theory, Ser. B 81(2), 318\u2013338 (2001)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"6","key":"9283_CR15","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"T. Mikkel","year":"2004","unstructured":"Mikkel, T.: Compact oracles for reachability and approximate distances in planar digraphs. J. ACM 51(6), 993\u20131024 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"9283_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1\u201324 (2005)","journal-title":"J. ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9283-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-010-9283-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-010-9283-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T08:46:56Z","timestamp":1636274816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-010-9283-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,27]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9283"],"URL":"https:\/\/doi.org\/10.1007\/s00224-010-9283-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,27]]}}}