{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T17:01:59Z","timestamp":1780074119091,"version":"3.54.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,23]]},"DOI":"10.1145\/1146381.1146411","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"188-197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Object location using path separators"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Hebrew University of Jerusalem, Jerusalem, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"University of Bordeaux, Bordeaux, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,7,23]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.72"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_32"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148143"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00072-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100254"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480191198768"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89571"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405013"},{"key":"e_1_3_2_1_10_1","volume-title":"16th Symposium on Discrete Algorithms (SODA), ACM-SIAM","author":"Chan H. T.-H.","year":"2005","unstructured":"H. T.-H. Chan , A. Gupta , B. M. Maggs , and S. Zhou , On hierarchical routing in doubling metrics , in 16th Symposium on Discrete Algorithms (SODA), ACM-SIAM , Jan. 2005 .]] H. T.-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou, On hierarchical routing in doubling metrics, in 16th Symposium on Discrete Algorithms (SODA), ACM-SIAM, Jan. 2005.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101821.1101823"},{"key":"e_1_3_2_1_12_1","first-page":"682","volume-title":"15th Symposium on Discrete Algorithms (SODA), ACM-SIAM","author":"Demaine E. D.","year":"2005","unstructured":"E. D. Demaine and M. Hajiaghayi , Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality , in 15th Symposium on Discrete Algorithms (SODA), ACM-SIAM , Jan. 2005 , pp. 682 -- 689 .]] E. D. Demaine and M. Hajiaghayi, Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality, in 15th Symposium on Discrete Algorithms (SODA), ACM-SIAM, Jan. 2005, pp. 682--689.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1998.1886"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050082"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.008"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060674"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-002-1033-y"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_70"},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"28th International Colloquium on Automata, Languages and Programming (ICALP)","author":"Fraigniaud P.","year":"2001","unstructured":"P. Fraigniaud and C. Gavoille , Routing in trees , in 28th International Colloquium on Automata, Languages and Programming (ICALP) , vol. 2076 of LNCS , Springer , July 2001 , pp. 757 -- 772 .]] P. Fraigniaud and C. Gavoille, Routing in trees, in 28th International Colloquium on Automata, Languages and Programming (ICALP), vol. 2076 of LNCS, Springer, July 2001, pp. 757--772.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762113"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218058"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_22"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1705"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(84)90019-1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0037-9"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702409927"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"key":"e_1_3_2_1_30_1","volume-title":"International Congress of Mathematicians (ICM), ACM Press","author":"Kleinberg J.","year":"2006","unstructured":"J. Kleinberg , Complex networks and decentralized search algorithms , in International Congress of Mathematicians (ICM), ACM Press , Aug. 2006 . To appear.]] ---, Complex networks and decentralized search algorithms, in International Congress of Mathematicians (ICM), ACM Press, Aug. 2006. To appear.]]"},{"key":"e_1_3_2_1_31_1","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","author":"Kloks T.","year":"1994","unstructured":"T. Kloks , Treewidth: Computations and Approximations , vol. 842 of LNCS , Springer-Verlag , June 1994 .]] T. Kloks, Treewidth: Computations and Approximations, vol. 842 of LNCS, Springer-Verlag, June 1994.]]"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011841"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"Mohar B.","year":"2001","unstructured":"B. Mohar and C. Thomassen , Graphs on Surfaces , The Johns Hopkins university Press , 2001 .]] B. Mohar and C. Thomassen, Graphs on Surfaces, The Johns Hopkins university Press, 2001.]]"},{"key":"e_1_3_2_1_35_1","first-page":"462","volume-title":"5th Symposium on Discrete Algorithms (SODA), ACM-SIAM","author":"Plotkin S. A.","year":"1994","unstructured":"S. A. Plotkin , S. B. Rao , and W. D. Smith , Shallow excluded minors and improved graph decomposition , in 5th Symposium on Discrete Algorithms (SODA), ACM-SIAM , 1994 , pp. 462 -- 470 .]] S. A. Plotkin, S. B. Rao, and W. D. Smith, Shallow excluded minors and improved graph decomposition, in 5th Symposium on Discrete Algorithms (SODA), ACM-SIAM, 1994, pp. 462--470.]]"},{"key":"e_1_3_2_1_36_1","volume-title":"A linear time algorithm to find a separation in a graph with an excluded minor","author":"Reed B.","year":"2005","unstructured":"B. Reed and D. R. Wood , A linear time algorithm to find a separation in a graph with an excluded minor , 2005 . Full version of EuroComb '05.]] B. Reed and D. R. Wood, A linear time algorithm to find a separation in a graph with an excluded minor, 2005. Full version of EuroComb '05.]]"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90030-4"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(03)00042-X"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1073"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073823"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007399"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.2013"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"}],"event":{"name":"PODC06: ACM Symposium on Principles of Distributed Computing 2006","location":"Denver Colorado USA","acronym":"PODC06","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1146381.1146411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T05:57:59Z","timestamp":1683525479000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1146381.1146411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,23]]},"references-count":43,"alternative-id":["10.1145\/1146381.1146411","10.1145\/1146381"],"URL":"https:\/\/doi.org\/10.1145\/1146381.1146411","relation":{},"subject":[],"published":{"date-parts":[[2006,7,23]]},"assertion":[{"value":"2006-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}