{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:28Z","timestamp":1781031448250,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Israel Science Foundation","award":["1336\/23"],"award-info":[{"award-number":["1336\/23"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800836","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1254-1265","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9212-9172","authenticated-orcid":false,"given":"Yotam","family":"Kenneth-Mordoch","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8154-3735","authenticated-orcid":false,"given":"Robert","family":"Krauthgamer","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00088"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00019"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00112"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Amir Abboud Robert Krauthgamer and Ohad Trabelsi. 2021. Subcubic algorithms for Gomory-Hu tree in unweighted graphs. In STOC \u201921. ACM 1725\u20131737. https:\/\/doi.org\/10.1145\/3406325.3451073 10.1145\/3406325.3451073","DOI":"10.1145\/3406325.3451073"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.143"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00035"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00137"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.44"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00055"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316361"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.19"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/JGT.21909"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.DAM.2005.10.014"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1961.1086832"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237827"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2022.20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250879"},{"key":"e_1_3_2_1_20_1","volume-title":"Parallel Submodular Function Minimization. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023","author":"Chakrabarty Deeparnab","year":"2023","unstructured":"Deeparnab Chakrabarty, Andrei Graur, Haotian Jiang, and Aaron Sidford. 2023. Parallel Submodular Function Minimization. In Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023. http:\/\/papers.nips.cc\/paper_files\/paper\/2023\/hash\/d8a7f2f7e346410e8ac7b39d9ff28c4a-Abstract-Conference.html"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3728631"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2024.46"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00111"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.21"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2025.43"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.22"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/265910.265914"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1090\/cams\/13"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2023.50"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792226825"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1091666"},{"key":"e_1_3_2_1_32_1","volume-title":"The Satisfactory Partition Problem. CoRR, abs\/2007.14339","author":"Gaikwad Ajinkya","year":"2020","unstructured":"Ajinkya Gaikwad, Soumen Maity, and Shuvam Kant Tripathi. 2020. The Satisfactory Partition Problem. CoRR, abs\/2007.14339 (2020), arXiv:2007.14339. arxiv:2007.14339"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103454"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00459-2"},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 1260\u20131279","author":"Ghaffari Mohsen","year":"2020","unstructured":"Mohsen Ghaffari, Krzysztof Nowicki, and Mikkel Thorup. 2020. Faster algorithms for edge connectivity via random 2-out contractions. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 1260\u20131279."},{"key":"e_1_3_2_1_36_1","volume-title":"A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow. CoRR, abs\/2510.03427","author":"Gholizadeh Hossein","year":"2025","unstructured":"Hossein Gholizadeh and Yonggang Jiang. 2025. A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow. CoRR, abs\/2510.03427 (2025), arXiv:2510.03427. arxiv:2510.03427"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.CH3"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1163153"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.132"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2020.64"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.139"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283398"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2025.36"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1180335"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/320211.320215"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502095"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.12"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00088"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.107"},{"key":"e_1_3_2_1_51_1","volume-title":"Flow Metrics on Graphs. CoRR, abs\/2112.06916","author":"Kalman Lior","year":"2021","unstructured":"Lior Kalman and Robert Krauthgamer. 2021. Flow Metrics on Graphs. CoRR, abs\/2112.06916 (2021), arXiv:2112.06916. arxiv:2112.06916"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.81"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276714"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3274663"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ESA.2025.100"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.150"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978964.31"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2014.02.011"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2021.15"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00111"},{"key":"e_1_3_2_1_61_1","volume-title":"Deterministic Weighted Expander Decomposition in Almost-linear Time. CoRR, abs\/2106.01567","author":"Li Jason","year":"2021","unstructured":"Jason Li and Thatchaphol Saranurak. 2021. Deterministic Weighted Expander Decomposition in Almost-linear Time. CoRR, abs\/2106.01567 (2021), arXiv:2106.01567. arxiv:2106.01567"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-937X.00121"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384334"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758778"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2024.115"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ITCS.2018.39"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00493-007-0045-2"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44985-X_1"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1973.1083633"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.IPL.2010.10.017"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800836","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:02:53Z","timestamp":1781028173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":70,"alternative-id":["10.1145\/3798129.3800836","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800836","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}