{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:40:04Z","timestamp":1750196404517,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["715672"],"award-info":[{"award-number":["715672"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451092","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"421-432","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Breaking the quadratic barrier for matroid intersection"],"prefix":"10.1145","author":[{"given":"Joakim","family":"Blikstad","sequence":"first","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"van den Brand","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3722-4679","authenticated-orcid":false,"given":"Sagnik","family":"Mukhopadhyay","sequence":"additional","affiliation":[{"name":"KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4468-2675","authenticated-orcid":false,"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Denmark \/ KTH, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Matching Theory for Combinatorial","volume":"158","author":"Aigner Martin","year":"1971","unstructured":"Martin Aigner and Thomas A. Dowling. 1971. Matching Theory for Combinatorial Geometries. Trans. Amer. Math. Soc., 158, 1, 1971. Pages 231\u2013245.","journal-title":"Geometries. Trans. Amer. Math. Soc."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00072"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","unstructured":"Chandra Chekuri and Kent Quanrud. 2016. A Fast Approximation for Maximum Weight Matroid Intersection. In SODA. SIAM. Pages 445\u2013457. https:\/\/doi.org\/10.1137\/1.9781611974331.ch33 10.1137\/1.9781611974331.ch33","DOI":"10.1137\/1.9781611974331.ch33"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215066"},{"key":"e_1_3_2_1_5_1","unstructured":"Jack Edmonds. 1970. Submodular functions matroids and certain polyhedra. In Combinatorial structures and their applications. Pages 69\u201387."},{"volume-title":"Annals of discrete Mathematics. 4","author":"Edmonds Jack","key":"e_1_3_2_1_6_1","unstructured":"Jack Edmonds. 1979. Matroid intersection. In Annals of discrete Mathematics. 4, Elsevier. Pages 39\u201349."},{"key":"e_1_3_2_1_7_1","volume-title":"Matroid partition. 50 Years of Integer Programming 1958\u20132008","author":"Edmonds Jack","year":"1968","unstructured":"Jack Edmonds, GB Dantzig, AF Veinott, and M J\u00fcnger. 1968. Matroid partition. 50 Years of Integer Programming 1958\u20132008, 1968. Pages 199."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.64"},{"key":"e_1_3_2_1_9_1","unstructured":"Nicholas J. A. Harvey. 2008. Matroid intersection pointer chasing and Young's seminormal representation of S\\(_\\mbox n\\). In SODA. SIAM. Pages 542\u2013549."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01681329"},{"key":"e_1_3_2_1_11_1","volume-title":"On the cut dimension of a graph. CoRR, abs\/2011.05085","author":"Lee Troy","year":"2020","unstructured":"Troy Lee, Tongyang Li, Miklos Santha, and Shengyu Zhang. 2020. On the cut dimension of a graph. CoRR, abs\/2011.05085, 2020."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.68"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"Sagnik Mukhopadhyay and Danupon Nanongkai. 2020. Weighted min-cut: sequential cut-query and streaming algorithms. In STOC. ACM. Pages 496\u2013509. https:\/\/doi.org\/10.1145\/3357713.3384334","DOI":"10.1145\/3357713.3384334"},{"key":"e_1_3_2_1_14_1","volume-title":"A note on Cunningham's algorithm for matroid intersection. CoRR, abs\/1904.04129","author":"Nguyen Huy L.","year":"2019","unstructured":"Huy L. Nguyen. 2019. A note on Cunningham's algorithm for matroid intersection. CoRR, abs\/1904.04129, 2019."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2018.39"},{"key":"e_1_3_2_1_16_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"Schrijver Alexander","year":"2003","unstructured":"Alexander Schrijver. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Italy","acronym":"STOC '21"},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":16,"alternative-id":["10.1145\/3406325.3451092","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451092","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}