{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:47:43Z","timestamp":1774687663477,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"DARPA","award":["HR0011-18-2-0032"],"award-info":[{"award-number":["HR0011-18-2-0032"]}]},{"DOI":"10.13039\/100014553","name":"Samsung Advanced Institute of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014553","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IITP","award":["2021-0-00754"],"award-info":[{"award-number":["2021-0-00754"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,23]]},"DOI":"10.1145\/3649329.3655991","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["PPA-Relevant Clustering-Driven Placement for Large-Scale VLSI Designs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4490-5018","authenticated-orcid":false,"given":"Andrew","family":"Kahng","sequence":"first","affiliation":[{"name":"UC San Diego, La Jolla, CA, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3015-1806","authenticated-orcid":false,"given":"Seokhyeong","family":"Kang","sequence":"additional","affiliation":[{"name":"POSTECH, Pohang-si, Gyeongsangbuk-do, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8077-1328","authenticated-orcid":false,"given":"Sayak","family":"Kundu","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA, United States"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4965-5484","authenticated-orcid":false,"given":"Kyungjun","family":"Min","sequence":"additional","affiliation":[{"name":"POSTECH, Pohang-si, Gyeongsangbuk-do, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0046-1387","authenticated-orcid":false,"given":"Seonghyeon","family":"Park","sequence":"additional","affiliation":[{"name":"POSTECH, Pohang-si, Gyeongsangbuk-do, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6014-1048","authenticated-orcid":false,"given":"Bodhisatta","family":"Pramanik","sequence":"additional","affiliation":[{"name":"UC San Diego, La Jolla, CA, United States"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055179"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.870079"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107637"},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Fast Unfolding of Communities in Large Networks","volume":"10","author":"Blondel V. D.","year":"2008","unstructured":"V. D. Blondel, J. L. Guillaume, R. Lambiotte and E. Lefebvre, \"Fast Unfolding of Communities in Large Networks\", J. Stat. Mech. Theor. Exp., 10 (2008), pp. 1--12.","journal-title":"J. Stat. Mech. Theor. Exp."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323975"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549390"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2859220"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/505388.505398"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2020.03.007"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.825868"},{"key":"e_1_3_2_1_12_1","first-page":"343","volume-title":"Proc. DAC","author":"Karypis G.","year":"1999","unstructured":"G. Karypis and V. Kumar, \"Multilevel K-Way Hypergraph Partitioning\", Proc. DAC, 1999, pp. 343--348."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160958"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3551901.3556482"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323942"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-92106-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855969"},{"key":"e_1_3_2_1_18_1","first-page":"181","volume-title":"Proc. ISPD","author":"Shelar R. S.","year":"2007","unstructured":"R. S. Shelar, \"An Efficient Clustering Algorithm for Low Power Clock Tree Synthesis\", Proc. ISPD, 2007, pp. 181--188."},{"key":"e_1_3_2_1_19_1","first-page":"9","article-title":"From Louvain To Leiden: Guaranteeing Well-Connected Communities","author":"Traag V. A.","year":"2019","unstructured":"V. A. Traag, L. Waltman and N. J. van Eck, \"From Louvain To Leiden: Guaranteeing Well-Connected Communities\", Scientific Reports 9 (2019).","journal-title":"Scientific Reports"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357975"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2991\/msam-17.2017.68"},{"key":"e_1_3_2_1_22_1","unstructured":"ABKGroup\/BlobPlacement GitHub Repository. https:\/\/github.com\/ABKGroup\/BlobPlacement"},{"key":"e_1_3_2_1_23_1","unstructured":"Cadence Innovus Implementation System version 21.1. www.cadence.com"},{"key":"e_1_3_2_1_24_1","unstructured":"NanGate45 PDK. https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD-flow-scripts\/tree\/master\/flow\/platforms\/nangate45"},{"key":"e_1_3_2_1_25_1","unstructured":"The OpenROAD Project (GitHub). https:\/\/theopenroadproject.org and https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD"},{"key":"e_1_3_2_1_26_1","unstructured":"OpenSTA Static Timer. https:\/\/github.com\/The-OpenROAD-Project\/OpenSTA"},{"key":"e_1_3_2_1_27_1","unstructured":"OpenROAD-Flow-Scripts. https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD-flow-scripts"},{"key":"e_1_3_2_1_28_1","unstructured":"TILOS MacroPlacement repository. https:\/\/github.com\/TILOS-AI-Institute\/MacroPlacement"},{"key":"e_1_3_2_1_29_1","unstructured":"TritonPart: An Open-Source Constraints-Driven Partitioner. https:\/\/github.com\/The-OpenROAD-Project\/OpenROAD\/tree\/master\/src\/par"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":29,"alternative-id":["10.1145\/3649329.3655991","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3655991","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}