{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:05:12Z","timestamp":1768313112665,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T00:00:00Z","timestamp":1548028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,1,21]]},"DOI":"10.1145\/3287624.3287676","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T21:45:18Z","timestamp":1547847918000},"page":"569-576","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Finding placement-relevant clusters with fast modularity-based clustering"],"prefix":"10.1145","author":[{"given":"Mateus","family":"Foga\u00e7a","sequence":"first","affiliation":[{"name":"Universidade Federal do Rio Grande do Sul"}]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[{"name":"UC San Diego"}]},{"given":"Ricardo","family":"Reis","sequence":"additional","affiliation":[{"name":"Universidade Federal do Rio Grande do Sul"}]},{"given":"Lutong","family":"Wang","sequence":"additional","affiliation":[{"name":"UC San Diego"}]}],"member":"320","published-online":{"date-parts":[[2019,1,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"e_1_3_2_1_2_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. of Statistical Mechanics: Theory and Experiment 10 ( 2008 ), pp. 1 -- 12 . V. D. Blondel, J. L. Guillaume, R. Lambiotte and E. Lefebvre, \"Fast Unfolding of Communities in Large Networks\", J. of Statistical Mechanics: Theory and Experiment 10 (2008), pp. 1--12.","journal-title":"J. of Statistical Mechanics: Theory and Experiment"},{"key":"e_1_3_2_1_3_1","first-page":"444","volume-title":"Proc. ASP-DAC","author":"Blutman K.","year":"2017","unstructured":"K. Blutman , H. Fatemi , A. B. Kahng , A. Kapoor , J. Li and J. P. de Gyvez , \"Floorplan and Placement Methodology for Improved Energy Reduction in Stacked Power-Domain Design\" , Proc. ASP-DAC , 2017 , pp. 444 -- 449 . K. Blutman, H. Fatemi, A. B. Kahng, A. Kapoor, J. Li and J. P. de Gyvez, \"Floorplan and Placement Methodology for Improved Energy Reduction in Stacked Power-Domain Design\", Proc. ASP-DAC, 2017, pp. 444--449."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/368434.368864"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASIC.1992.270313"},{"key":"e_1_3_2_1_6_1","first-page":"670","volume-title":"Proc. DAC","author":"Cheng C.-K.","year":"1994","unstructured":"C.-K. Cheng , A. B. Kahng , I. Kang and L. Wang , \" RePlAce: Advancing Solution Quality and Routability Validation in Global Placement\", IEEE Trans. on CAD (2018), Boolean Networks \", Proc. DAC , 1994 , pp. 670 -- 675 . C.-K. Cheng, A. B. Kahng, I. Kang and L. Wang, \"RePlAce: Advancing Solution Quality and Routability Validation in Global Placement\", IEEE Trans. on CAD (2018), Boolean Networks\", Proc. DAC, 1994, pp. 670--675."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1979.4766909"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056714"},{"key":"e_1_3_2_1_9_1","first-page":"175","volume-title":"Proc. DAC","author":"Fiduccia C. M.","year":"1982","unstructured":"C. M. Fiduccia and R. M. Mattheyses , \" A Linear-Time Heuristic for Improving Network Partitions \", Proc. DAC , 1982 , pp. 175 -- 181 . C. M. Fiduccia and R. M. Mattheyses, \"A Linear-Time Heuristic for Improving Network Partitions\", Proc. DAC, 1982, pp. 175--181."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3036669.3038249"},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"Resolution Limit in Community Detection","volume":"69","author":"Fortunato S.","year":"2007","unstructured":"S. Fortunato and M. Barthelemy ,\" Resolution Limit in Community Detection \", Proc. Proc. Nat. Acad. Sci. 69 ( 2007 ), pp. 1 -- 15 . S. Fortunato and M. Barthelemy,\" Resolution Limit in Community Detection\", Proc. Proc. Nat. Acad. Sci. 69 (2007), pp. 1--15.","journal-title":"Proc. Proc. Nat. Acad. Sci."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_3_2_1_13_1","first-page":"414","volume-title":"Proc. ICCAD","author":"Frankle J.","year":"1986","unstructured":"J. Frankle and R. M. Karp , \" Circuit Placement and Cost Bounds by Eigenvector Decomposition \", Proc. ICCAD , 1986 , pp. 414 -- 417 . J. Frankle and R. M. Karp, \"Circuit Placement and Cost Bounds by Eigenvector Decomposition\", Proc. ICCAD, 1986, pp. 414--417."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/110316.149364"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.3.219"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/787258.787419"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90115-P"},{"key":"e_1_3_2_1_18_1","unstructured":"K. Jeong A. B. Kahng and H. Yao RentCon: Rent Parameter Evaluation Using Different Methods. https:\/\/vlsicad.ucsd.edu\/WLD\/index.html  K. Jeong A. B. Kahng and H. Yao RentCon: Rent Parameter Evaluation Using Different Methods. https:\/\/vlsicad.ucsd.edu\/WLD\/index.html"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/640000.640019"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3199854"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266273"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer T.","year":"1990","unstructured":"T. Lengauer , Combinatorial Algorithms for Integrated Circuit Layout , New York , Wiley-Teubner , 1990 . T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, New York, Wiley-Teubner, 1990."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3177540.3177562"},{"key":"e_1_3_2_1_25_1","volume-title":"Computational Geometry: Algorithms and Applications","author":"Mark D. B.","year":"1997","unstructured":"D. B. Mark , M. Overmars and O. Cheong , Computational Geometry: Algorithms and Applications , New York , Springer , 1997 . D. B. Mark, M. Overmars and O. Cheong, Computational Geometry: Algorithms and Applications, New York, Springer, 1997."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. ISPD, 2018","author":"Olofsson A.","year":"2018","unstructured":"A. Olofsson , \"Silicon Compilers - Version 2.0\", keynote , Proc. ISPD, 2018 . http:\/\/www.ispd.cc\/slides\/ 2018 \/k2.pdf A. Olofsson, \"Silicon Compilers - Version 2.0\", keynote, Proc. ISPD, 2018. http:\/\/www.ispd.cc\/slides\/2018\/k2.pdf"},{"key":"e_1_3_2_1_28_1","first-page":"105","volume-title":"Proc. ASP-DAC","author":"Ou S.","year":"1999","unstructured":"S. Ou and M. Pedram , \" Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming \", Proc. ASP-DAC , 1999 , pp. 105 -- 108 . S. Ou and M. Pedram, \"Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming\", Proc. ASP-DAC, 1999, pp. 105--108."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855969"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1231996.1232037"},{"key":"e_1_3_2_1_31_1","first-page":"1170","volume-title":"Proc. AAAI","author":"Shiokawa H.","year":"2013","unstructured":"H. Shiokawa , Y. Fujiwara and M. Onizuka , \" Fast Algorithm for Modularity-based Graph Clustering \", Proc. AAAI , 2013 , pp. 1170 -- 1176 . H. Shiokawa, Y. Fujiwara and M. Onizuka, \"Fast Algorithm for Modularity-based Graph Clustering\", Proc. AAAI, 2013, pp. 1170--1176."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809980"},{"key":"e_1_3_2_1_33_1","volume-title":"Encyclopedia of Social Network Analysis and Mining","author":"Shiokawa H.","year":"2017","unstructured":"H. Shiokawa and M. Onizuka , \" Scalable Graph Clustering and Its Applications \", Encyclopedia of Social Network Analysis and Mining , New York , Springer , 2017 . H. Shiokawa and M. Onizuka, \"Scalable Graph Clustering and Its Applications\", Encyclopedia of Social Network Analysis and Mining, New York, Springer, 2017."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119935"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/31.76488"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_3_2_1_37_1","first-page":"50","volume-title":"Proc. ICCAD","author":"Yang H.","year":"1994","unstructured":"H. Yang and D. F. Wong , \" Efficient Network Flow Based Min-cut Balanced Partitioning \"', Proc. ICCAD , 1994 , pp. 50 -- 55 . H. Yang and D. F. Wong, \"Efficient Network Flow Based Min-cut Balanced Partitioning\"', Proc. ICCAD, 1994, pp. 50--55."},{"key":"e_1_3_2_1_38_1","unstructured":"\"DARPA Rolls Out Electronics Resurgence Initiative\" https:\/\/www.darpa.mil\/news-events\/2017-09-13  \"DARPA Rolls Out Electronics Resurgence Initiative\" https:\/\/www.darpa.mil\/news-events\/2017-09-13"},{"key":"e_1_3_2_1_39_1","unstructured":"International Technology Roadmap for Semiconductors http:\/\/www.itrs2.net\/itrs-reports.html International Technology Roadmap for Semiconductors http:\/\/www.itrs2.net\/itrs-reports.html"},{"key":"e_1_3_2_1_40_1","unstructured":"Alpha shape https:\/\/en.wikipedia.org\/wiki\/Alpha_shape  Alpha shape https:\/\/en.wikipedia.org\/wiki\/Alpha_shape"},{"key":"e_1_3_2_1_41_1","unstructured":"K. Jeong A. B. Kahng and H. Yao RentCon: Rent Parameter Evaluation Using Different Methods https:\/\/vlsicad.ucsd.edu\/WLD\/index.html  K. Jeong A. B. Kahng and H. Yao RentCon: Rent Parameter Evaluation Using Different Methods https:\/\/vlsicad.ucsd.edu\/WLD\/index.html"},{"key":"e_1_3_2_1_42_1","unstructured":"OpenCores: Open Source IP-Cores http:\/\/www.opencores.org.  OpenCores: Open Source IP-Cores http:\/\/www.opencores.org."},{"key":"e_1_3_2_1_43_1","unstructured":"RePlAce https:\/\/github.com\/abk-openroad\/RePlAce  RePlAce https:\/\/github.com\/abk-openroad\/RePlAce"},{"key":"e_1_3_2_1_44_1","unstructured":"Rsyn https:\/\/github.com\/RsynTeam\/rsyn-x  Rsyn https:\/\/github.com\/RsynTeam\/rsyn-x"}],"event":{"name":"ASPDAC '19: 24th Asia and South Pacific Design Automation Conference","location":"Tokyo Japan","acronym":"ASPDAC '19","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEICE ESS Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society","IEEE CAS","IEEE CEDA","IPSJ SIG-SLDM Information Processing Society of Japan, SIG System LSI Design Methodology"]},"container-title":["Proceedings of the 24th Asia and South Pacific Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3287624.3287676","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3287624.3287676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:08:04Z","timestamp":1750208884000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3287624.3287676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,21]]},"references-count":44,"alternative-id":["10.1145\/3287624.3287676","10.1145\/3287624"],"URL":"https:\/\/doi.org\/10.1145\/3287624.3287676","relation":{},"subject":[],"published":{"date-parts":[[2019,1,21]]},"assertion":[{"value":"2019-01-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}