{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:37Z","timestamp":1750309477961,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":90,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1844855, CCF-1955039"],"award-info":[{"award-number":["CCF-1844855, CCF-1955039"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585135","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1215-1228","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Maxflow via Dynamic Interior Point Methods"],"prefix":"10.1145","author":[{"given":"Jan","family":"van den Brand","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}]},{"given":"Yang P.","family":"Liu","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Aaron","family":"Sidford","sequence":"additional","affiliation":[{"name":"Stanford University, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"volume-title":"Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms","author":"Abboud Amir","key":"e_1_3_2_1_1_1","unstructured":"Amir Abboud and S\u00f8ren Dahlgaard . 2016. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms . In FOCS. IEEE Computer Society , 477\u2013486. Amir Abboud and S\u00f8ren Dahlgaard. 2016. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. In FOCS. IEEE Computer Society, 477\u2013486."},{"volume-title":"Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems","author":"Abboud Amir","key":"e_1_3_2_1_2_1","unstructured":"Amir Abboud and Virginia Vassilevska Williams . 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems . In FOCS. IEEE Computer Society , 434\u2013443. Amir Abboud and Virginia Vassilevska Williams. 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In FOCS. IEEE Computer Society, 434\u2013443."},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In ICALP (LIPIcs, Vol. 107)","volume":"7","author":"Arar Moab","year":"2018","unstructured":"Moab Arar , Shiri Chechik , Sarel Cohen , Cliff Stein , and David Wajc . 2018 . Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In ICALP (LIPIcs, Vol. 107) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 7 : 1 \u2013 7 :16. Moab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, and David Wajc. 2018. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 7:1\u20137:16.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_4_1","volume-title":"On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs\/2207.09354","author":"Assadi Sepehr","year":"2022","unstructured":"Sepehr Assadi , Soheil Behnezhad , Sanjeev Khanna , and Huan Li. 2022. On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs\/2207.09354 ( 2022 ). Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, and Huan Li. 2022. On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs\/2207.09354 (2022)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00018"},{"volume-title":"Faster Sparse Minimum Cost Flow by Electrical Flow Localization","author":"Axiotis Kyriakos","key":"e_1_3_2_1_6_1","unstructured":"Kyriakos Axiotis , Aleksander Madry , and Adrian Vladu . 2021. Faster Sparse Minimum Cost Flow by Electrical Flow Localization . In FOCS. IEEE , 528\u2013539. Kyriakos Axiotis, Aleksander Madry, and Adrian Vladu. 2021. Faster Sparse Minimum Cost Flow by Electrical Flow Localization. In FOCS. IEEE, 528\u2013539."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/130914140"},{"key":"e_1_3_2_1_8_1","volume-title":"Dynamic Algorithms for Maximum Matching Size. CoRR, abs\/2207.07607","author":"Behnezhad Soheil","year":"2022","unstructured":"Soheil Behnezhad . 2022. Dynamic Algorithms for Maximum Matching Size. CoRR, abs\/2207.07607 ( 2022 ). Soheil Behnezhad. 2022. Dynamic Algorithms for Maximum Matching Size. CoRR, abs\/2207.07607 (2022)."},{"volume-title":"Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time","author":"Behnezhad Soheil","key":"e_1_3_2_1_9_1","unstructured":"Soheil Behnezhad , Mahsa Derakhshan , MohammadTaghi Hajiaghayi , Cliff Stein , and Madhu Sudan . 2019. Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time . In FOCS. IEEE Computer Society , 382\u2013405. Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, and Madhu Sudan. 2019. Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. In FOCS. IEEE Computer Society, 382\u2013405."},{"volume-title":"New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS","author":"Behnezhad Soheil","key":"e_1_3_2_1_10_1","unstructured":"Soheil Behnezhad and Sanjeev Khanna . 2022. New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS . In SODA. SIAM , 3529\u20133566. Soheil Behnezhad and Sanjeev Khanna. 2022. New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. In SODA. SIAM, 3529\u20133566."},{"key":"e_1_3_2_1_11_1","volume-title":"Mirrokni","author":"Behnezhad Soheil","year":"2020","unstructured":"Soheil Behnezhad , Jakub Lacki , and Vahab S . Mirrokni . 2020 . Fully Dynamic Matching: Beating 2-Approximation in \u0394 ^\u220a Update Time. In SODA. SIAM , 2492\u20132508. Soheil Behnezhad, Jakub Lacki, and Vahab S. Mirrokni. 2020. Fully Dynamic Matching: Beating 2-Approximation in \u0394 ^\u220a Update Time. In SODA. SIAM, 2492\u20132508."},{"volume-title":"Incremental Topological Sort and Cycle Detection in O(m\u221a n) Expected Total Time","author":"Bernstein Aaron","key":"e_1_3_2_1_12_1","unstructured":"Aaron Bernstein and Shiri Chechik . 2018. Incremental Topological Sort and Cycle Detection in O(m\u221a n) Expected Total Time . In SODA. SIAM , 21\u201334. Aaron Bernstein and Shiri Chechik. 2018. Incremental Topological Sort and Cycle Detection in O(m\u221a n) Expected Total Time. In SODA. SIAM, 21\u201334."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3469833"},{"key":"e_1_3_2_1_14_1","volume-title":"Maximilian Probst Gutenberg, and Thatchaphol Saranurak","author":"Bernstein Aaron","year":"2021","unstructured":"Aaron Bernstein , Maximilian Probst Gutenberg, and Thatchaphol Saranurak . 2021 . Deterministic decremental SSSP and approximate min-cost flow in almost-linear time. arXiv preprint arXiv:2101.07149. Aaron Bernstein, Maximilian Probst Gutenberg, and Thatchaphol Saranurak. 2021. Deterministic decremental SSSP and approximate min-cost flow in almost-linear time. arXiv preprint arXiv:2101.07149."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3344999"},{"volume-title":"ICALP (1) (Lecture Notes in Computer Science","author":"Bernstein Aaron","key":"e_1_3_2_1_16_1","unstructured":"Aaron Bernstein and Cliff Stein . 2015. Fully Dynamic Matching in Bipartite Graphs . In ICALP (1) (Lecture Notes in Computer Science , Vol. 9134). Springer, 167\u2013 179 . Aaron Bernstein and Cliff Stein. 2015. Fully Dynamic Matching in Bipartite Graphs. In ICALP (1) (Lecture Notes in Computer Science, Vol. 9134). Springer, 167\u2013179."},{"volume-title":"Faster Fully Dynamic Matchings with Small Approximation Ratios","author":"Bernstein Aaron","key":"e_1_3_2_1_17_1","unstructured":"Aaron Bernstein and Cliff Stein . 2016. Faster Fully Dynamic Matchings with Small Approximation Ratios . In SODA. SIAM , 692\u2013711. Aaron Bernstein and Cliff Stein. 2016. Faster Fully Dynamic Matchings with Small Approximation Ratios. In SODA. SIAM, 692\u2013711."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Sayan Bhattacharya Monika Henzinger and Danupon Nanongkai. 2016. New deterministic approximation algorithms for fully dynamic matching. In STOC. ACM 398\u2013411. Sayan Bhattacharya Monika Henzinger and Danupon Nanongkai. 2016. New deterministic approximation algorithms for fully dynamic matching. In STOC. ACM 398\u2013411.","DOI":"10.1145\/2897518.2897568"},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"Deterministic Rounding of Dynamic Fractional Matchings. In ICALP (LIPIcs, Vol. 198)","volume":"27","author":"Bhattacharya Sayan","year":"2021","unstructured":"Sayan Bhattacharya and Peter Kiss . 2021 . Deterministic Rounding of Dynamic Fractional Matchings. In ICALP (LIPIcs, Vol. 198) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 27 : 1 \u2013 27 :14. Sayan Bhattacharya and Peter Kiss. 2021. Deterministic Rounding of Dynamic Fractional Matchings. In ICALP (LIPIcs, Vol. 198). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 27:1\u201327:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Sayan Bhattacharya Peter Kiss and Thatchaphol Saranurak. 2022. Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. arXiv preprint arXiv:2207.07519. Sayan Bhattacharya Peter Kiss and Thatchaphol Saranurak. 2022. Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. arXiv preprint arXiv:2207.07519.","DOI":"10.1137\/1.9781611977554.ch1"},{"key":"e_1_3_2_1_21_1","volume-title":"Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR, abs\/2207.07438","author":"Bhattacharya Sayan","year":"2022","unstructured":"Sayan Bhattacharya , Peter Kiss , Thatchaphol Saranurak , and David Wajc . 2022. Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR, abs\/2207.07438 ( 2022 ). Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, and David Wajc. 2022. Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR, abs\/2207.07438 (2022)."},{"key":"e_1_3_2_1_22_1","volume-title":"Deterministically Maintaining a (2+\u220a )-Approximate Minimum Vertex Cover in O(1\/\u220a ^2) Amortized Update Time","author":"Bhattacharya Sayan","year":"1872","unstructured":"Sayan Bhattacharya and Janardhan Kulkarni . 2019. Deterministically Maintaining a (2+\u220a )-Approximate Minimum Vertex Cover in O(1\/\u220a ^2) Amortized Update Time . In SODA. SIAM , 1872 \u20131885. Sayan Bhattacharya and Janardhan Kulkarni. 2019. Deterministically Maintaining a (2+\u220a )-Approximate Minimum Vertex Cover in O(1\/\u220a ^2) Amortized Update Time. In SODA. SIAM, 1872\u20131885."},{"volume-title":"An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs","author":"Bhattacharya Sayan","key":"e_1_3_2_1_23_1","unstructured":"Sayan Bhattacharya and Janardhan Kulkarni . 2020. An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs . In SODA. SIAM , 2509\u20132521. Sayan Bhattacharya and Janardhan Kulkarni. 2020. An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs. In SODA. SIAM, 2509\u20132521."},{"volume-title":"Online Bipartite Matching in Offline Time","author":"Bosek Bartlomiej","key":"e_1_3_2_1_24_1","unstructured":"Bartlomiej Bosek , Dariusz Leniowski , Piotr Sankowski , and Anna Zych . 2014. Online Bipartite Matching in Offline Time . In FOCS. IEEE Computer Society , 384\u2013393. Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, and Anna Zych. 2014. Online Bipartite Matching in Offline Time. In FOCS. IEEE Computer Society, 384\u2013393."},{"key":"e_1_3_2_1_25_1","volume-title":"Yang P. Liu, Richard Peng, and Aaron Sidford.","author":"van den Brand Jan","year":"2022","unstructured":"Jan van den Brand , Yu Gao , Arun Jambulapati , Yin Tat Lee , Yang P. Liu, Richard Peng, and Aaron Sidford. 2022 . Faster maxflow via improved dynamic spectral vertex sparsifiers. In STOC. ACM , 543\u2013556. Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, and Aaron Sidford. 2022. Faster maxflow via improved dynamic spectral vertex sparsifiers. In STOC. ACM, 543\u2013556."},{"key":"e_1_3_2_1_26_1","volume-title":"Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang.","author":"van den Brand Jan","year":"2021","unstructured":"Jan van den Brand , Yin Tat Lee , Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. 2021 . Minimum cost flows, MDPs, and \u2113 _1-regression in nearly linear time for dense instances. In STOC. ACM , 859\u2013869. Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. 2021. Minimum cost flows, MDPs, and \u2113 _1-regression in nearly linear time for dense instances. In STOC. ACM, 859\u2013869."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00090"},{"volume-title":"Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds","author":"van den Brand Jan","key":"e_1_3_2_1_28_1","unstructured":"Jan van den Brand , Danupon Nanongkai , and Thatchaphol Saranurak . 2019. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds . In FOCS. IEEE Computer Society , 456\u2013480. Jan van den Brand, Danupon Nanongkai, and Thatchaphol Saranurak. 2019. Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. In FOCS. IEEE Computer Society, 456\u2013480."},{"key":"e_1_3_2_1_29_1","first-page":"1","article-title":"Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. In ICALP (LIPIcs, Vol. 107)","volume":"33","author":"Charikar Moses","year":"2018","unstructured":"Moses Charikar and Shay Solomon . 2018 . Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. In ICALP (LIPIcs, Vol. 107) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 33 : 1 \u2013 33 :14. Moses Charikar and Shay Solomon. 2018. Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time Barrier. In ICALP (LIPIcs, Vol. 107). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 33:1\u201333:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"volume-title":"Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time","author":"Chechik Shiri","key":"e_1_3_2_1_30_1","unstructured":"Shiri Chechik and Tianyi Zhang . 2019. Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time . In FOCS. IEEE Computer Society , 370\u2013381. Shiri Chechik and Tianyi Zhang. 2019. Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. In FOCS. IEEE Computer Society, 370\u2013381."},{"volume-title":"Incremental Single Source Shortest Paths in Sparse Digraphs","author":"Chechik Shiri","key":"e_1_3_2_1_31_1","unstructured":"Shiri Chechik and Tianyi Zhang . 2021. Incremental Single Source Shortest Paths in Sparse Digraphs . In SODA. SIAM , 2463\u20132477. Shiri Chechik and Tianyi Zhang. 2021. Incremental Single Source Shortest Paths in Sparse Digraphs. In SODA. SIAM, 2463\u20132477."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00109"},{"key":"e_1_3_2_1_33_1","volume-title":"Maximilian Probst Gutenberg, and Sushant Sachdeva","author":"Chen Li","year":"2022","unstructured":"Li Chen , Rasmus Kyng , Yang P. Liu , Richard Peng , Maximilian Probst Gutenberg, and Sushant Sachdeva . 2022 . Maximum Flow and Minimum-Cost Flow in Almost-Linear Time . 612\u2013623. arxiv:2203.00671 Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva. 2022. Maximum Flow and Minimum-Cost Flow in Almost-Linear Time. 612\u2013623. arxiv:2203.00671"},{"volume-title":"A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond","author":"Chuzhoy Julia","key":"e_1_3_2_1_34_1","unstructured":"Julia Chuzhoy , Yu Gao , Jason Li , Danupon Nanongkai , Richard Peng , and Thatchaphol Saranurak . 2020. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond . In FOCS. IEEE , 1158\u20131167. Julia Chuzhoy, Yu Gao, Jason Li, Danupon Nanongkai, Richard Peng, and Thatchaphol Saranurak. 2020. A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond. In FOCS. IEEE, 1158\u20131167."},{"volume-title":"Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in \"0365O(m^10\/7) Time (Extended Abstract)","author":"Cohen Michael B.","key":"e_1_3_2_1_35_1","unstructured":"Michael B. Cohen , Aleksander M\u0105dry , Piotr Sankowski , and Adrian Vladu . 2017. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in \"0365O(m^10\/7) Time (Extended Abstract) . In SODA. SIAM , 752\u2013771. Michael B. Cohen, Aleksander M\u0105dry, Piotr Sankowski, and Adrian Vladu. 2017. Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in \"0365O(m^10\/7) Time (Extended Abstract). In SODA. SIAM, 752\u2013771."},{"key":"e_1_3_2_1_36_1","first-page":"1","article-title":"On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In ICALP (LIPIcs, Vol. 55)","volume":"48","author":"Dahlgaard S\u00f8ren","year":"2016","unstructured":"S\u00f8ren Dahlgaard . 2016 . On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In ICALP (LIPIcs, Vol. 55) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 48 : 1 \u2013 48 :14. S\u00f8ren Dahlgaard. 2016. On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In ICALP (LIPIcs, Vol. 55). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 48:1\u201348:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_37_1","volume-title":"Richard Peng, Sushant Sachdeva, and Guanghao Ye.","author":"Dong Sally","year":"2022","unstructured":"Sally Dong , Yu Gao , Gramoz Goranci , Yin Tat Lee , Richard Peng, Sushant Sachdeva, and Guanghao Ye. 2022 . Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. In SODA. SIAM , 124\u2013153. Sally Dong, Yu Gao, Gramoz Goranci, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Guanghao Ye. 2022. Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time. In SODA. SIAM, 124\u2013153."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265914"},{"key":"e_1_3_2_1_39_1","series-title":"SIAM journal on computing, 4, 4","volume-title":"Network Flow and Testing Graph Connectivity","author":"Even Shimon","year":"1975","unstructured":"Shimon Even and R. Endre Tarjan . 1975. Network Flow and Testing Graph Connectivity . SIAM journal on computing, 4, 4 ( 1975 ), 507\u2013518. Shimon Even and R. Endre Tarjan. 1975. Network Flow and Testing Graph Connectivity. SIAM journal on computing, 4, 4 (1975), 507\u2013518."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214055"},{"volume-title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao","author":"Gao Yu","key":"e_1_3_2_1_41_1","unstructured":"Yu Gao , Yang P. Liu , and Richard Peng . 2021. Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao . In FOCS. IEEE , 516\u2013527. Yu Gao, Yang P. Liu, and Richard Peng. 2021. Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao. In FOCS. IEEE, 516\u2013527."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446232"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"e_1_3_2_1_44_1","unstructured":"Gramoz Goranci and Monika Henzinger. 2022. Incremental Approximate Maximum Flow in m^1\/2+o(1) update time. arXiv preprint arXiv:2211.09606 Available at arxiv:2211.09606 Gramoz Goranci and Monika Henzinger. 2022. Incremental Approximate Maximum Flow in m^1\/2+o(1) update time. arXiv preprint arXiv:2211.09606 Available at arxiv:2211.09606"},{"key":"e_1_3_2_1_45_1","first-page":"1","article-title":"Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. In ESA (LIPIcs, Vol. 57)","volume":"46","author":"Goranci Gramoz","year":"2016","unstructured":"Gramoz Goranci , Monika Henzinger , and Mikkel Thorup . 2016 . Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. In ESA (LIPIcs, Vol. 57) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 46 : 1 \u2013 46 :17. Gramoz Goranci, Monika Henzinger, and Mikkel Thorup. 2016. Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time. In ESA (LIPIcs, Vol. 57). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 46:1\u201346:17.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"volume-title":"The Expander Hierarchy and its Applications to Dynamic Graph Algorithms","author":"Goranci Gramoz","key":"e_1_3_2_1_46_1","unstructured":"Gramoz Goranci , Harald R\u00e4cke , Thatchaphol Saranurak , and Zihan Tan . 2021. The Expander Hierarchy and its Applications to Dynamic Graph Algorithms . In SODA. SIAM , 2212\u20132228. Gramoz Goranci, Harald R\u00e4cke, Thatchaphol Saranurak, and Zihan Tan. 2021. The Expander Hierarchy and its Applications to Dynamic Graph Algorithms. In SODA. SIAM, 2212\u20132228."},{"volume-title":"Density-Sensitive and with Worst-Case Time Bounds","author":"Grandoni Fabrizio","key":"e_1_3_2_1_47_1","unstructured":"Fabrizio Grandoni , Chris Schwiegelshohn , Shay Solomon , and Amitai Uzrad . 2022. Maintaining an EDCS in General Graphs: Simpler , Density-Sensitive and with Worst-Case Time Bounds . In SOSA. SIAM , 12\u201323. Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, and Amitai Uzrad. 2022. Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds. In SOSA. SIAM, 12\u201323."},{"key":"e_1_3_2_1_48_1","volume-title":"FSTTCS (LIPIcs","volume":"239","author":"Gupta Manoj","year":"2014","unstructured":"Manoj Gupta . 2014 . Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time . In FSTTCS (LIPIcs , Vol. 29). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 227\u2013 239 . Manoj Gupta. 2014. Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. In FSTTCS (LIPIcs, Vol. 29). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 227\u2013239."},{"volume-title":"Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching","author":"Gupta Manoj","key":"e_1_3_2_1_49_1","unstructured":"Manoj Gupta and Shahbaz Khan . 2021. Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching . In SOSA. SIAM , 86\u201391. Manoj Gupta and Shahbaz Khan. 2021. Simple dynamic algorithms for Maximal Independent Set, Maximum Flow and Maximum Matching. In SOSA. SIAM, 86\u201391."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Manoj Gupta and Richard Peng. 2013. Fully Dynamic (1+ e)-Approximate Matchings. In FOCS. IEEE Computer Society 548\u2013557. Manoj Gupta and Richard Peng. 2013. Fully Dynamic (1+ e)-Approximate Matchings. In FOCS. IEEE Computer Society 548\u2013557.","DOI":"10.1109\/FOCS.2013.65"},{"key":"e_1_3_2_1_51_1","volume-title":"Virginia Vassilevska Williams, and Nicole Wein","author":"Gutenberg Maximilian Probst","year":"2020","unstructured":"Maximilian Probst Gutenberg , Virginia Vassilevska Williams, and Nicole Wein . 2020 . New algorithms and hardness for incremental single-source shortest paths in directed graphs. In STOC. ACM , 153\u2013166. Maximilian Probst Gutenberg, Virginia Vassilevska Williams, and Nicole Wein. 2020. New algorithms and hardness for incremental single-source shortest paths in directed graphs. In STOC. ACM, 153\u2013166."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Monika Henzinger Sebastian Krinninger Danupon Nanongkai and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In STOC. ACM 21\u201330. Monika Henzinger Sebastian Krinninger Danupon Nanongkai and Thatchaphol Saranurak. 2015. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture. In STOC. ACM 21\u201330.","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63165-8_214"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/280032.280036"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_62"},{"volume-title":"Fully Dynamic Connectivity in O( ologn ( olog ologn)^2) Amortized Expected Time","author":"Huang Shang-En","key":"e_1_3_2_1_58_1","unstructured":"Shang-En Huang , Dawei Huang , Tsvi Kopelowitz , and Seth Pettie . 2017. Fully Dynamic Connectivity in O( ologn ( olog ologn)^2) Amortized Expected Time . In SODA. SIAM , 510\u2013520. Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, and Seth Pettie. 2017. Fully Dynamic Connectivity in O( ologn ( olog ologn)^2) Amortized Expected Time. In SODA. SIAM, 510\u2013520."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/39515.39523"},{"key":"e_1_3_2_1_60_1","first-page":"1","article-title":"Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. In ICALP (LIPIcs, Vol. 229)","volume":"77","author":"Jambulapati Arun","year":"2022","unstructured":"Arun Jambulapati , Yujia Jin , Aaron Sidford , and Kevin Tian . 2022 . Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. In ICALP (LIPIcs, Vol. 229) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 77 : 1 \u2013 77 :20. Arun Jambulapati, Yujia Jin, Aaron Sidford, and Kevin Tian. 2022. Regularized Box-Simplex Games and Dynamic Decremental Bipartite Matching. In ICALP (LIPIcs, Vol. 229). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 77:1\u201377:20.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"volume-title":"Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract)","author":"Jin Wenyu","key":"e_1_3_2_1_61_1","unstructured":"Wenyu Jin and Xiaorui Sun . 2021. Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract) . In FOCS. IEEE , 861\u2013872. Wenyu Jin and Xiaorui Sun. 2021. Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract). In FOCS. IEEE, 861\u2013872."},{"key":"e_1_3_2_1_62_1","volume-title":"Flow Rounding. CoRR, abs\/1507.08139","author":"Kang Donggu","year":"2015","unstructured":"Donggu Kang and James Payor . 2015. Flow Rounding. CoRR, abs\/1507.08139 ( 2015 ). Donggu Kang and James Payor. 2015. Flow Rounding. CoRR, abs\/1507.08139 (2015)."},{"key":"e_1_3_2_1_63_1","first-page":"81","article-title":"On finding maximum flows in networks with special structure and some applications","volume":"5","author":"Karzanov Alexander V","year":"1973","unstructured":"Alexander V Karzanov . 1973 . On finding maximum flows in networks with special structure and some applications . Matematicheskie Voprosy Upravleniya Proizvodstvom , 5 (1973), 81 \u2013 94 . Alexander V Karzanov. 1973. On finding maximum flows in networks with special structure and some applications. Matematicheskie Voprosy Upravleniya Proizvodstvom, 5 (1973), 81\u201394.","journal-title":"Matematicheskie Voprosy Upravleniya Proizvodstvom"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00020"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.16"},{"key":"e_1_3_2_1_66_1","volume-title":"Improving update times of dynamic matching algorithms from amortized to worst case. CoRR, abs\/2108.10461","author":"Kiss Peter","year":"2021","unstructured":"Peter Kiss . 2021. Improving update times of dynamic matching algorithms from amortized to worst case. CoRR, abs\/2108.10461 ( 2021 ). Peter Kiss. 2021. Improving update times of dynamic matching algorithms from amortized to worst case. CoRR, abs\/2108.10461 (2021)."},{"volume-title":"Higher Lower Bounds from the 3SUM Conjecture","author":"Kopelowitz Tsvi","key":"e_1_3_2_1_67_1","unstructured":"Tsvi Kopelowitz , Seth Pettie , and Ely Porat . 2016. Higher Lower Bounds from the 3SUM Conjecture . In SODA. SIAM , 1272\u20131287. Tsvi Kopelowitz, Seth Pettie, and Ely Porat. 2016. Higher Lower Bounds from the 3SUM Conjecture. In SODA. SIAM, 1272\u20131287."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023607406540"},{"volume-title":"Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier","author":"Kyng Rasmus","key":"e_1_3_2_1_69_1","unstructured":"Rasmus Kyng , Simon Meierhans , and Maximilian Probst Gutenberg . 2022. Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier . In SODA. SIAM , 3452\u20133481. Rasmus Kyng, Simon Meierhans, and Maximilian Probst Gutenberg. 2022. Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier. In SODA. SIAM, 3452\u20133481."},{"key":"e_1_3_2_1_70_1","first-page":"1","article-title":"Dynamic Matching Algorithms Under Vertex Updates. In ITCS (LIPIcs, Vol. 215)","volume":"96","author":"Le Hung","year":"2022","unstructured":"Hung Le , Lazar Milenkovic , Shay Solomon , and Virginia Vassilevska Williams . 2022 . Dynamic Matching Algorithms Under Vertex Updates. In ITCS (LIPIcs, Vol. 215) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 96 : 1 \u2013 96 :24. Hung Le, Lazar Milenkovic, Shay Solomon, and Virginia Vassilevska Williams. 2022. Dynamic Matching Algorithms Under Vertex Updates. In ITCS (LIPIcs, Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 96:1\u201396:24.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"volume-title":"Path Finding Methods for Linear Programming: Solving Linear Programs in \u00d8 (\u221a rank) Iterations and Faster Algorithms for Maximum Flow","author":"Lee Yin Tat","key":"e_1_3_2_1_71_1","unstructured":"Yin Tat Lee and Aaron Sidford . 2014. Path Finding Methods for Linear Programming: Solving Linear Programs in \u00d8 (\u221a rank) Iterations and Faster Algorithms for Maximum Flow . In FOCS. IEEE Computer Society , 424\u2013433. Yin Tat Lee and Aaron Sidford. 2014. Path Finding Methods for Linear Programming: Solving Linear Programs in \u00d8 (\u221a rank) Iterations and Faster Algorithms for Maximum Flow. In FOCS. IEEE Computer Society, 424\u2013433."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384247"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_74_1","volume-title":"Computing Maximum Flow with Augmenting Electrical Flows. In 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016","author":"M\u0105dry Aleksander","year":"2016","unstructured":"Aleksander M\u0105dry . 2016 . Computing Maximum Flow with Augmenting Electrical Flows. In 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016 , 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. IEEE Computer Society, 593\u2013602. Available at arxiv:1608.06016 Aleksander M\u0105dry. 2016. Computing Maximum Flow with Augmenting Electrical Flows. In 57th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA. IEEE Computer Society, 593\u2013602. Available at arxiv:1608.06016"},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Danupon Nanongkai and Thatchaphol Saranurak. 2017. Dynamic spanning forest with worst-case update time: adaptive Las Vegas and O(n^1\/2-\u220a )-time. In STOC. ACM 1122\u20131129. Danupon Nanongkai and Thatchaphol Saranurak. 2017. Dynamic spanning forest with worst-case update time: adaptive Las Vegas and O(n^1\/2-\u220a )-time. In STOC. ACM 1122\u20131129.","DOI":"10.1145\/3055399.3055447"},{"key":"e_1_3_2_1_76_1","volume-title":"Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017","author":"Nanongkai Danupon","year":"2017","unstructured":"Danupon Nanongkai , Thatchaphol Saranurak , and Christian Wulff-Nilsen . 2017 . Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017 , Berkeley, CA, USA , October 15-17, 2017, Chris Umans (Ed.). IEEE Computer Society, 950\u2013961. Available at: arxiv:1708.03962 Danupon Nanongkai, Thatchaphol Saranurak, and Christian Wulff-Nilsen. 2017. Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, Chris Umans (Ed.). IEEE Computer Society, 950\u2013961. Available at: arxiv:1708.03962"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447256"},{"volume-title":"A Density-Sensitive Approach","author":"Peleg David","key":"e_1_3_2_1_78_1","unstructured":"David Peleg and Shay Solomon . 2016. Dynamic (1 + \u220a )- Approximate Matchings : A Density-Sensitive Approach . In SODA. SIAM , 712\u2013729. David Peleg and Shay Solomon. 2016. Dynamic (1 + \u220a )-Approximate Matchings: A Density-Sensitive Approach. In SODA. SIAM, 712\u2013729."},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch130"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"crossref","unstructured":"Harald R\u00e4cke. 2008. Optimal hierarchical decompositions for congestion minimization in networks. In STOC. ACM 255\u2013264. Harald R\u00e4cke. 2008. Optimal hierarchical decompositions for congestion minimization in networks. In STOC. ACM 255\u2013264.","DOI":"10.1145\/1374376.1374415"},{"key":"e_1_3_2_1_81_1","first-page":"1","article-title":"Beating the Folklore Algorithm for Dynamic Matching. In ITCS (LIPIcs, Vol. 215)","volume":"111","author":"Roghani Mohammad","year":"2022","unstructured":"Mohammad Roghani , Amin Saberi , and David Wajc . 2022 . Beating the Folklore Algorithm for Dynamic Matching. In ITCS (LIPIcs, Vol. 215) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 111 : 1 \u2013 111 :23. Mohammad Roghani, Amin Saberi, and David Wajc. 2022. Beating the Folklore Algorithm for Dynamic Matching. In ITCS (LIPIcs, Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 111:1\u2013111:23.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"volume-title":"Faster dynamic matchings and vertex connectivity","author":"Sankowski Piotr","key":"e_1_3_2_1_82_1","unstructured":"Piotr Sankowski . 2007. Faster dynamic matchings and vertex connectivity . In SODA. SIAM , 118\u2013126. Piotr Sankowski. 2007. Faster dynamic matchings and vertex connectivity. In SODA. SIAM, 118\u2013126."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"volume-title":"Fully Dynamic Maximal Matching in Constant Update Time","author":"Solomon Shay","key":"e_1_3_2_1_84_1","unstructured":"Shay Solomon . 2016. Fully Dynamic Maximal Matching in Constant Update Time . In FOCS. IEEE Computer Society , 325\u2013334. Shay Solomon. 2016. Fully Dynamic Maximal Matching in Constant Update Time. In FOCS. IEEE Computer Society, 325\u2013334."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"crossref","unstructured":"Mikkel Thorup. 2000. Near-optimal fully-dynamic graph connectivity. In STOC. ACM 343\u2013350. Mikkel Thorup. 2000. Near-optimal fully-dynamic graph connectivity. In STOC. ACM 343\u2013350.","DOI":"10.1145\/335305.335345"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"crossref","unstructured":"Mikkel Thorup. 2001. Fully-dynamic min-cut. In STOC. ACM 224\u2013230. Mikkel Thorup. 2001. Fully-dynamic min-cut. In STOC. ACM 224\u2013230.","DOI":"10.1145\/380752.380804"},{"key":"e_1_3_2_1_87_1","volume-title":"Dynamic Maxflow via Dynamic Interior Point Methods. CoRR, abs\/2212.06315","author":"van den Brand Jan","year":"2022","unstructured":"Jan van den Brand , Yang P. Liu , and Aaron Sidford . 2022. Dynamic Maxflow via Dynamic Interior Point Methods. CoRR, abs\/2212.06315 ( 2022 ). Jan van den Brand, Yang P. Liu, and Aaron Sidford. 2022. Dynamic Maxflow via Dynamic Interior Point Methods. CoRR, abs\/2212.06315 (2022)."},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"crossref","unstructured":"David Wajc. 2020. Rounding dynamic matchings against an adaptive adversary. In STOC. ACM 194\u2013207. David Wajc. 2020. Rounding dynamic matchings against an adaptive adversary. In STOC. ACM 194\u2013207.","DOI":"10.1145\/3357713.3384258"},{"volume-title":"Faster Deterministic Fully-Dynamic Graph Connectivity","author":"Wulff-Nilsen Christian","key":"e_1_3_2_1_89_1","unstructured":"Christian Wulff-Nilsen . 2013. Faster Deterministic Fully-Dynamic Graph Connectivity . In SODA. SIAM , 1757\u20131769. Christian Wulff-Nilsen. 2013. Faster Deterministic Fully-Dynamic Graph Connectivity. In SODA. SIAM, 1757\u20131769."},{"key":"e_1_3_2_1_90_1","doi-asserted-by":"crossref","unstructured":"Christian Wulff-Nilsen. 2017. Fully-dynamic minimum spanning forest with improved worst-case update time. In STOC. ACM 1130\u20131143. Christian Wulff-Nilsen. 2017. Fully-dynamic minimum spanning forest with improved worst-case update time. In STOC. ACM 1130\u20131143.","DOI":"10.1145\/3055399.3055415"}],"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.3585135","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585135","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:27Z","timestamp":1750295847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":90,"alternative-id":["10.1145\/3564246.3585135","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585135","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"}}]}}