{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:35Z","timestamp":1750306115849,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T00:00:00Z","timestamp":1497744000000},"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":[[2017,6,18]]},"DOI":"10.1145\/3061639.3062215","type":"proceedings-article","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T12:18:42Z","timestamp":1497356322000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Convergence-Boosted Graph Partitioning using Maximum Spanning Trees for Iterative Solution of Large Linear Circuits"],"prefix":"10.1145","author":[{"given":"Ya","family":"Wang","sequence":"first","affiliation":[{"name":"Texas A&M University, College Station, TX"}]},{"given":"Wenrui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX"}]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX"}]},{"given":"Jian","family":"Gong","sequence":"additional","affiliation":[{"name":"Intel Corporation, Hillsboro, OR"}]}],"member":"320","published-online":{"date-parts":[[2017,6,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824801.1824814"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801384019"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801390637"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2132325.2132451"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1326073.1326085"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2009.4810391"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687477"},{"key":"e_1_3_2_1_9_1","volume-title":"Electronic Circuit & System Simulation Methods (SRE)","author":"Pillage Lawrence","year":"1998","unstructured":"Lawrence Pillage . Electronic Circuit & System Simulation Methods (SRE) . McGraw-Hill, Inc. , 1998 . Lawrence Pillage. Electronic Circuit & System Simulation Methods (SRE). McGraw-Hill, Inc., 1998."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/6.48845"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429473"},{"key":"e_1_3_2_1_12_1","volume-title":"Metis--unstructured graph partitioning and sparse matrixordering system, version 2.0","author":"Karypis George","year":"1995","unstructured":"George Karypis and Vipin Kumar . Metis--unstructured graph partitioning and sparse matrixordering system, version 2.0 . 1995 . George Karypis and Vipin Kumar. Metis--unstructured graph partitioning and sparse matrixordering system, version 2.0. 1995."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1356802.1356895"}],"event":{"name":"DAC '17: The 54th Annual Design Automation Conference 2017","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"],"location":"Austin TX USA","acronym":"DAC '17"},"container-title":["Proceedings of the 54th Annual Design Automation Conference 2017"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3061639.3062215","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3061639.3062215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:34Z","timestamp":1750217794000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3061639.3062215"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,18]]},"references-count":13,"alternative-id":["10.1145\/3061639.3062215","10.1145\/3061639"],"URL":"https:\/\/doi.org\/10.1145\/3061639.3062215","relation":{},"subject":[],"published":{"date-parts":[[2017,6,18]]},"assertion":[{"value":"2017-06-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}