{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:03:12Z","timestamp":1780675392938,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T00:00:00Z","timestamp":1718150400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["HR0011-18-2-0032"],"award-info":[{"award-number":["HR0011-18-2-0032"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,12]]},"DOI":"10.1145\/3649476.3658744","type":"proceedings-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T12:29:41Z","timestamp":1718022581000},"page":"177-184","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Scalable Flip-Flop Clustering Using Divide and Conquer For Capacitated K-Means"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4490-5018","authenticated-orcid":false,"given":"Andrew B.","family":"Kahng","sequence":"first","affiliation":[{"name":"University of California, San Diego, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8077-1328","authenticated-orcid":false,"given":"Sayak","family":"Kundu","sequence":"additional","affiliation":[{"name":"University of California, San Diego, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2184-2376","authenticated-orcid":false,"given":"Shreyas","family":"Thumathy","sequence":"additional","affiliation":[{"name":"Precision Innovations Inc., USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1027","volume-title":"Proc. SODA","author":"Arthur D.","year":"2007","unstructured":"[1] D. Arthur and S. Vassilvitskii, \u201c k-means++: The Advantages of Careful Seeding\u201d, Proc. SODA, 2007, pp. 1027-1035."},{"key":"e_1_3_2_1_2_1","first-page":"11","volume-title":"Proc. ISPD","author":"Chang Y.-C.","year":"2019","unstructured":"[2] Y.-C. Chang, T.-W. Lin, I. H.-R. Jiang and G.-J. Nam, \u201cGraceful Register Clustering by Effective Mean Shift Algorithm for Power and Timing Balance\u201d, Proc. ISPD, 2019, pp. 11-18."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mejo.2016.04.006"},{"key":"e_1_3_2_1_4_1","first-page":"1","volume-title":"Proc. ICCAD","author":"Kahng A. B.","year":"2016","unstructured":"[4] A. B. Kahng, J. Li and L. Wang, \u201cImproved Flop Tray-Based Design Implementation for Power Reducation\u201d, Proc. ICCAD, 2016, pp. 20:1-20:8."},{"key":"e_1_3_2_1_5_1","unstructured":"[5] J. Li personal communication 2023."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA49011.2020.00096"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898025"},{"key":"e_1_3_2_1_9_1","unstructured":"[9] ASAP7 PDK and Cell Libraries. https:\/\/github.com\/The-OpenROAD-Project\/asap7"},{"key":"e_1_3_2_1_10_1","unstructured":"[10] DATC Robust Design Flow. https:\/\/github.com\/ieee-ceda-datc\/RDF-2020\/tree\/master"},{"key":"e_1_3_2_1_11_1","unstructured":"[11] IBM ILOG CPLEX. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio"},{"key":"e_1_3_2_1_12_1","unstructured":"[12] LEMON. https:\/\/lemon.cs.elte.hu\/trac\/lemon"},{"key":"e_1_3_2_1_13_1","unstructured":"[13] MBFF Clustering. https:\/\/github.com\/ABKGroup\/MBFFClustering"},{"key":"e_1_3_2_1_14_1","unstructured":"[14] MemPool Repo. https:\/\/github.com\/pulp-platform\/mempool"},{"key":"e_1_3_2_1_15_1","unstructured":"[15] OpenCores. https:\/\/opencores.org\/"},{"key":"e_1_3_2_1_16_1","unstructured":"[16] OpenROAD Flow Scripts. https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD-flow-scripts commit hash: 731787b."},{"key":"e_1_3_2_1_17_1","unstructured":"[17] OpenROAD. https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD commit hash: db8cd96."},{"key":"e_1_3_2_1_18_1","unstructured":"[18] Register Clustering. https:\/\/github.com\/waynelin567\/Register_Clustering commit hash: bad8f27."}],"event":{"name":"GLSVLSI '24: Great Lakes Symposium on VLSI 2024","location":"Clearwater FL USA","acronym":"GLSVLSI '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the Great Lakes Symposium on VLSI 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649476.3658744","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3649476.3658744","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649476.3658744","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649476.3658744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T02:32:17Z","timestamp":1755829937000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649476.3658744"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,12]]},"references-count":18,"alternative-id":["10.1145\/3649476.3658744","10.1145\/3649476"],"URL":"https:\/\/doi.org\/10.1145\/3649476.3658744","relation":{},"subject":[],"published":{"date-parts":[[2024,6,12]]},"assertion":[{"value":"2024-06-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}