{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:32:20Z","timestamp":1750221140630,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188960","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"404-417","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Incomplete nested dissection"],"prefix":"10.1145","author":[{"given":"Rasmus","family":"Kyng","sequence":"first","affiliation":[{"name":"Simons Institute for the Theory of Computing Berkeley, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Peng","sequence":"additional","affiliation":[{"name":"Georgia Tech, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schwieterman","sequence":"additional","affiliation":[{"name":"Georgia Tech, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Georgia Tech, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934996"},{"volume-title":"Kyle Fox, and Amir Nayyeri. Minimum cycle and homology bases of surface embedded graphs. arXiv preprint arXiv:1607.05112","year":"2016","author":"Borradaile Glencora","key":"e_1_3_2_2_2_1"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80059-5"},{"key":"e_1_3_2_2_4_1","unstructured":"STOC\u201918 June 25\u201329 2018 Los Angeles CA USA Rasmus Kyng Richard Peng Robert Schwieterman and Peng Zhang  STOC\u201918 June 25\u201329 2018 Los Angeles CA USA Rasmus Kyng Richard Peng Robert Schwieterman and Peng Zhang"},{"volume-title":"All-pairs minimum cuts in near-linear time for surface-embedded graphs. arXiv preprint arXiv:1411.7055","year":"2014","author":"Borradaile Glencora","key":"e_1_3_2_2_5_1"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1127"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.73"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.73"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/120875338"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.15"},{"volume-title":"Paul Erdos is Eighty, 2(157-172):13\u20132","year":"1996","author":"Chung Fan RK","key":"e_1_3_2_2_11_1"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591833"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055463"},{"volume-title":"Support-graph preconditioners for 2-dimensional trusses. arXiv preprint cs\/0703119","year":"2007","author":"Daitch Samuel I","key":"e_1_3_2_2_14_1"},{"first-page":"1354","volume-title":"Proceedings of the twenty-second annual ACMSIAM symposium on Discrete Algorithms","author":"Erickson Jeff","key":"e_1_3_2_2_15_1"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90253-8"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479892236921"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1076"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897640"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.85"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488672"},{"first-page":"582","volume-title":"Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on","author":"Kyng Rasmus","key":"e_1_3_2_2_26_1"},{"volume-title":"Hardness results for structured linear systems. arXiv preprint arXiv:1705.02944","year":"2017","author":"Kyng Rasmus","key":"e_1_3_2_2_27_1"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2665063"},{"key":"e_1_3_2_2_30_1","series-title":"SIAM journal on numerical analysis, 16(2):346\u2013358","volume-title":"Generalized nested dissection","author":"Lipton Richard J","year":"1979"},{"volume-title":"European Symposium on Algorithms","key":"e_1_3_2_2_31_1","first-page":"166"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100255"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827594262613"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/142675.142720"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3002-x"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591832"},{"first-page":"92","volume-title":"Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms","author":"Ruppert Jim","key":"e_1_3_2_2_37_1"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.5555\/829576"},{"volume-title":"An analysis of the finite element method","year":"1973","author":"Strang Gilbert","key":"e_1_3_2_2_39_1"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2014.01.002"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/060650295"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Los Angeles CA USA","acronym":"STOC '18"},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188960","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:07Z","timestamp":1750208887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":42,"alternative-id":["10.1145\/3188745.3188960","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188960","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}