{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:10:47Z","timestamp":1750219847796,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Austrian Science Fund (FWF)","award":["P 32863-N"],"award-info":[{"award-number":["P 32863-N"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["947702"],"award-info":[{"award-number":["947702"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss National Foundation","award":["200021 204787"],"award-info":[{"award-number":["200021 204787"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585213","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1173-1186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Forster","sequence":"first","affiliation":[{"name":"University of Salzburg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasamin","family":"Nazari","sequence":"additional","affiliation":[{"name":"University of Salzburg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"Probst Gutenberg","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520066"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_3_1","volume-title":"Dynamic Decremental Approximate Distance Oracles with (1+\u220a , 2) stretch. CoRR, abs\/1307.1516","author":"Abraham Ittai","year":"2013","unstructured":"Ittai Abraham and Shiri Chechik . 2013. Dynamic Decremental Approximate Distance Oracles with (1+\u220a , 2) stretch. CoRR, abs\/1307.1516 ( 2013 ), arXiv:1307.1516. Ittai Abraham and Shiri Chechik. 2013. Dynamic Decremental Approximate Distance Oracles with (1+\u220a , 2) stretch. CoRR, abs\/1307.1516 (2013), arXiv:1307.1516."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.28"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2014.1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103966"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384321"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.08.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344425"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294260"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.110"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/130938670"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897521"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00100"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.104"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00025"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00109"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977585.ch5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451025"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316320"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.147"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039492"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.05.005"},{"key":"e_1_3_2_1_26_1","volume-title":"New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR, abs\/2211.01152","author":"Dory Michal","year":"2022","unstructured":"Michal Dory , Sebastian Forster , Yasamin Nazari , and Tijn de Vos . 2022. New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR, abs\/2211.01152 ( 2022 ), https:\/\/doi.org\/10.48550\/arXiv.2211.01152 arXiv:2211.01152. 10.48550\/arXiv.2211.01152 Michal Dory, Sebastian Forster, Yasamin Nazari, and Tijn de Vos. 2022. New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths. CoRR, abs\/2211.01152 (2022), https:\/\/doi.org\/10.48550\/arXiv.2211.01152 arXiv:2211.01152."},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of the Symposium on Theory of Graphs and its Applications). 2936","author":"Erd\u0151s Paul","year":"1963","unstructured":"Paul Erd\u0151s . 1963 . Extremal problems in graph theory . In Proc. of the Symposium on Theory of Graphs and its Applications). 2936 . Paul Erd\u0151s. 1963. Extremal problems in graph theory. In Proc. of the Symposium on Theory of Graphs and its Applications). 2936."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.64"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322235"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.75"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.156"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1171"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.79"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/140957299"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3218657"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2019.65"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520058"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2022.86"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806708"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9401-5"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/090776573"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11533719_47"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_33"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060607"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_49_1","volume-title":"Proc. of the 63rd IEEE Annual Symposium on Foundations of Computer Science, (FOCS","author":"van den Brand Jan","year":"2022","unstructured":"Jan van den Brand , Sebastian Forster , and Yasamin Nazari . 2022 . Fast Deterministic Fully Dynamic Distance Approximation . In Proc. of the 63rd IEEE Annual Symposium on Foundations of Computer Science, (FOCS 2022). arXiv:2111.03361. Jan van den Brand, Sebastian Forster, and Yasamin Nazari. 2022. Fast Deterministic Fully Dynamic Distance Approximation. In Proc. of the 63rd IEEE Annual Symposium on Foundations of Computer Science, (FOCS 2022). arXiv:2111.03361."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00035"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00036"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":51,"alternative-id":["10.1145\/3564246.3585213","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585213","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}