{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:44Z","timestamp":1750694804551,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"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-1527110, CCF-1618280, CCF-1814603, CCF-1910588, CCF1750808, CCF 2238138"],"award-info":[{"award-number":["CCF-1527110, CCF-1618280, CCF-1814603, CCF-1910588, CCF1750808, CCF 2238138"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["949272"],"award-info":[{"award-number":["949272"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss National Foundation","award":["200021-184735"],"award-info":[{"award-number":["200021-184735"]}]},{"name":"Air Force Office of Scientific Research","award":["FA9550-20-1-0080"],"award-info":[{"award-number":["FA9550-20-1-0080"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585202","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"1371-1383","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast"],"prefix":"10.1145","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[{"name":"ETH Zurich, Switzerland \/ Carnegie Mellon University, USA"}]},{"given":"D. Ellis","family":"Hershkowitz","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Thatchaphol","family":"Saranurak","sequence":"additional","affiliation":[{"name":"University of Michigan, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Symposium on Distributed Computing (DISC).","author":"Ahmadi Mohamad","year":"2018","unstructured":"Mohamad Ahmadi , Fabian Kuhn , and Rotem Oshman . 2018 . Distributed approximate maximum matching in the CONGEST model . In International Symposium on Distributed Computing (DISC). Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. 2018. Distributed approximate maximum matching in the CONGEST model. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24766-9_2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384321"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775105"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281141"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400834"},{"key":"e_1_3_2_1_7_1","volume-title":"Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 7, 949\u2013957","author":"Awerbuch Baruch","year":"2007","unstructured":"Baruch Awerbuch , Rohit Khandekar , and Satish Rao . 2007 . Distributed algorithms for multicommodity flow problems via approximate steepest descent framework . In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 7, 949\u2013957 . Baruch Awerbuch, Rohit Khandekar, and Satish Rao. 2007. Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 7, 949\u2013957."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868241"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461458"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.2.255.12228"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405745"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792232021"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"e_1_3_2_1_14_1","volume-title":"International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX).","author":"Chlamt\u00e1\u010d Eden","year":"2020","unstructured":"Eden Chlamt\u00e1\u010d and Petr Kolman . 2020 . How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut . In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX). Eden Chlamt\u00e1\u010d and Petr Kolman. 2020. How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)."},{"volume-title":"Symposium on Foundations of Computer Science (FOCS).","author":"Chu Timothy","key":"e_1_3_2_1_15_1","unstructured":"Timothy Chu , Yu Gao , Richard Peng , Sushant Sachdeva , Saurabh Sawlani , and Junxing Wang . 202. Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions . In Symposium on Foundations of Computer Science (FOCS). Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, and Junxing Wang. 202. Graph sparsification, spectral sketches, and faster resistance computation via short cycle decompositions. In Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00111"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236717"},{"key":"e_1_3_2_1_18_1","volume-title":"24th International Conference on Principles of Distributed Systems (OPODIS","author":"Faour Salwa","year":"2021","unstructured":"Salwa Faour and Fabian Kuhn . 2021 . Approximating bipartite minimum vertex cover in the CONGEST model . In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Salwa Faour and Fabian Kuhn. 2021. Approximating bipartite minimum vertex cover in the CONGEST model. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0344-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.23"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446232"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767440"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00066-7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451053"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520026"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00053"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451081"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755583"},{"key":"e_1_3_2_1_30_1","volume-title":"International Symposium on Distributed Computing (DISC).","author":"Hitron Yael","year":"2021","unstructured":"Yael Hitron and Merav Parter . 2021 . General CONGEST Compilers against Adversarial Edges . In International Symposium on Distributed Computing (DISC). Yael Hitron and Merav Parter. 2021. General CONGEST Compilers against Adversarial Edges. In International Symposium on Distributed Computing (DISC)."},{"key":"e_1_3_2_1_31_1","unstructured":"Richard M Karp and Vijaya Ramachandran. 1989. A survey of parallel algorithms for shared-memory machines. \t\t\t\t  Richard M Karp and Vijaya Ramachandran. 1989. A survey of parallel algorithms for shared-memory machines."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3274663","article-title":"Deterministic edge connectivity in near-linear time","volume":"66","author":"Mikkel Thorup Kawarabayashi","year":"2018","unstructured":"Ken-ichi Kawarabayashi and Mikkel Thorup . 2018 . Deterministic edge connectivity in near-linear time . Journal of the ACM (JACM) , 66 , 1 (2018), 1 \u2013 50 . Ken-ichi Kawarabayashi and Mikkel Thorup. 2018. Deterministic edge connectivity in near-linear time. Journal of the ACM (JACM), 66, 1 (2018), 1\u201350.","journal-title":"Journal of the ACM (JACM)"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04355-0_23"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378558"},{"key":"e_1_3_2_1_36_1","series-title":"SIAM journal on computing, 15, 4","volume-title":"A simple parallel algorithm for the maximal independent set problem","author":"Luby Michael","year":"1986","unstructured":"Michael Luby . 1986. A simple parallel algorithm for the maximal independent set problem . SIAM journal on computing, 15, 4 ( 1986 ), 1036\u20131053. Michael Luby. 1986. A simple parallel algorithm for the maximal independent set problem. SIAM journal on computing, 15, 4 (1986), 1036\u20131053."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.92"},{"key":"e_1_3_2_1_38_1","unstructured":"Merav Parter and Eylon Yogev. 2019. Optimal short cycle decomposition in almost linear time. In International Colloquium on Automata Languages and Programming (ICALP). \t\t\t\t  Merav Parter and Eylon Yogev. 2019. Optimal short cycle decomposition in almost linear time. In International Colloquium on Automata Languages and Programming (ICALP)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"David Peleg. 2000. Distributed computing: a locality-sensitive approach. SIAM. \t\t\t\t  David Peleg. 2000. Distributed computing: a locality-sensitive approach. SIAM.","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806792"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.162"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.22"}],"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.3585202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585202","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585202","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.3585202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":42,"alternative-id":["10.1145\/3564246.3585202","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585202","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"}}]}}