{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:08:27Z","timestamp":1775578107949,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214084","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1199-1218","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Microsoft Research, Silicon Valley Center, USA"}]},{"given":"Shiri","family":"Chechik","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rehovot, Israel"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"University of Bordeaux, Bordeaux, France"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835698.1835743"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90036-X"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509928"},{"key":"e_1_3_2_2_4_1","volume-title":"14th ACM Symp. on Discrete Algorithms (SODA), 394--403","author":"Baswana S.","year":"2003","unstructured":"S. Baswana , R. Hariharan , and S. Sen . Maintaining all-pairs approximate shortest paths under deletion of edges . In 14th ACM Symp. on Discrete Algorithms (SODA), 394--403 , 2003 . S. Baswana, R. Hariharan, and S. Sen. Maintaining all-pairs approximate shortest paths under deletion of edges. In 14th ACM Symp. on Discrete Algorithms (SODA), 394--403, 2003."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095136"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748002"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536431"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133140"},{"key":"e_1_3_2_2_9_1","volume-title":"38th Int'l Coll. on Automata, Languages and Programming (ICALP), 101--112","author":"Chechik S.","year":"2011","unstructured":"S. Chechik . Fault-tolerant compact routing schemes for general graphs . In 38th Int'l Coll. on Automata, Languages and Programming (ICALP), 101--112 , 2011 . S. Chechik. Fault-tolerant compact routing schemes for general graphs. In 38th Int'l Coll. on Automata, Languages and Programming (ICALP), 101--112, 2011."},{"key":"e_1_3_2_2_10_1","volume-title":"18th European Symposia on Algorithms (ESA), 84--96","author":"Chechik S.","year":"2010","unstructured":"S. Chechik , M. Langberg , D. Peleg , and L. Roditty . f-sensitivity distance oracles and routing schemes . In 18th European Symposia on Algorithms (ESA), 84--96 , 2010 . S. Chechik, M. Langberg, D. Peleg, and L. Roditty. f-sensitivity distance oracles and routing schemes. In 18th European Symposia on Algorithms (ESA), 84--96, 2010."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763424.1763430"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9211-9"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.005"},{"key":"e_1_3_2_2_15_1","volume-title":"13th ACM Symp. on Discrete Algorithms (SODA), 838--843","author":"Demetrescu C.","year":"2002","unstructured":"C. Demetrescu and M. Thorup . Oracles for distances avoiding a link-failure . In 13th ACM Symp. on Discrete Algorithms (SODA), 838--843 , 2002 . C. Demetrescu and M. Thorup. Oracles for distances avoiding a link-failure. In 13th ACM Symp. on Discrete Algorithms (SODA), 838--843, 2002."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496826"},{"key":"e_1_3_2_2_17_1","volume-title":"14th ACM Symp. on Discrete Algorithms (SODA), 599--608","author":"Eppstein D.","year":"2003","unstructured":"D. Eppstein . Dynamic generators of topologically embedded graphs . In 14th ACM Symp. on Discrete Algorithms (SODA), 599--608 , 2003 . D. Eppstein. Dynamic generators of topologically embedded graphs. In 14th ACM Symp. on Discrete Algorithms (SODA), 599--608, 2003."},{"key":"e_1_3_2_2_18_1","volume-title":"28th Int'l Coll. on Automata, Languages and Programming (ICALP), 757--772","author":"Fraigniaud P.","year":"2001","unstructured":"P. Fraigniaud and C. Gavoille . Routing in Trees . In 28th Int'l Coll. on Automata, Languages and Programming (ICALP), 757--772 , 2001 . P. Fraigniaud and C. Gavoille. Routing in Trees. In 28th Int'l Coll. on Automata, Languages and Programming (ICALP), 757--772, 2001."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796250"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797327209"},{"key":"e_1_3_2_2_21_1","volume-title":"38th Int'l Coll. on Automata, Languages and Programming (ICALP), 135--146","author":"Kawarabayashi K.","year":"2011","unstructured":"K. Kawarabayashi , P. N. Klein , and C. Sommer . Linear-space approximate distance oracles for planar, bounded-genus, and minor-free graphs . In 38th Int'l Coll. on Automata, Languages and Programming (ICALP), 135--146 , 2011 . K. Kawarabayashi, P. N. Klein, and C. Sommer. Linear-space approximate distance oracles for planar, bounded-genus, and minor-free graphs. In 38th Int'l Coll. on Automata, Languages and Programming (ICALP), 135--146, 2011."},{"key":"e_1_3_2_2_22_1","volume-title":"26th Symp. on Theoretical Aspects of Computer Science (STACS), 513--524","author":"Khanna N.","year":"2010","unstructured":"N. Khanna and S. Baswana . Approximate shortest path oracle under vertex failure . In 26th Symp. on Theoretical Aspects of Computer Science (STACS), 513--524 , 2010 . N. Khanna and S. Baswana. Approximate shortest path oracle under vertex failure. In 26th Symp. on Theoretical Aspects of Computer Science (STACS), 513--524, 2010."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796487"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009223"},{"key":"e_1_3_2_2_25_1","volume-title":"13th ACM Symp. on Discrete Algorithms (SODA), 820--827","author":"Klein P.","year":"2002","unstructured":"P. Klein . Preprocessing an undirected planar network to enable fast approximate distance queries . In 13th ACM Symp. on Discrete Algorithms (SODA), 820--827 , 2002 . P. Klein. Preprocessing an undirected planar network to enable fast approximate distance queries. In 13th ACM Symp. on Discrete Algorithms (SODA), 820--827, 2002."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.54"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875578"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_33"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060607"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.22"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214084","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:57Z","timestamp":1750238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":33,"alternative-id":["10.1145\/2213977.2214084","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214084","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}