{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:44Z","timestamp":1750307984751,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,4,9]],"date-time":"2006-04-09T00:00:00Z","timestamp":1144540800000},"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":[[2006,4,9]]},"DOI":"10.1145\/1123008.1123051","type":"proceedings-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T21:40:43Z","timestamp":1147124443000},"page":"200-205","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Net cluster"],"prefix":"10.1145","author":[{"given":"Jianhua","family":"Li","sequence":"first","affiliation":[{"name":"University of Calgary, Calgary, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laleh","family":"Behjat","sequence":"additional","affiliation":[{"name":"University of Calgary, Calgary, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,4,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055186"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055179"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/274535.274546"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.712098"},{"key":"e_1_3_2_1_5_1","volume-title":"Journal of Combinatorial Optimization","author":"Behjat L.","year":"2002","unstructured":"L. Behjat , D. Kucar , and A. Vannelli . A novel eigenvector technique fot large scale combinatorial problems in vlsi layout . Journal of Combinatorial Optimization , 2002 . L. Behjat, D. Kucar, and A. Vannelli. A novel eigenvector technique fot large scale combinatorial problems in vlsi layout. Journal of Combinatorial Optimization, 2002."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/368434.368864"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055177"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055188"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2004.823353"},{"key":"e_1_3_2_1_10_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 . In Proc. DAC , pages 175 -- 181 , 1982 . C. M. Fiduccia and R. M. Mattheyses. A linear time heuristic for improving network partitions. In Proc. DAC, pages 175--181, 1982."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/640000.640017"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266273"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309954"},{"key":"e_1_3_2_1_15_1","first-page":"5","article-title":"A connectivity based clustering algorithm with applications to vlsi circuit partitioning","author":"Li J.","year":"2005","unstructured":"J. Li and L. Behjat . A connectivity based clustering algorithm with applications to vlsi circuit partitioning . IEEE Trans. on CAS II, 10.1109\/TCSII. 2005 .862174: 5 , 2006. J. Li and L. Behjat. A connectivity based clustering algorithm with applications to vlsi circuit partitioning. IEEE Trans. on CAS II, 10.1109\/TCSII.2005.862174:5, 2006.","journal-title":"IEEE Trans. on CAS II, 10.1109\/TCSII."},{"key":"e_1_3_2_1_16_1","first-page":"260","volume-title":"Proc. ICCAD","author":"Wang X. Y. M.","year":"2000","unstructured":"X. Y. M. Wang and M. Sarrafzadeh . Dragon2000: Standard-cell placement tool for large industry circuits . In Proc. ICCAD , pages 260 -- 263 , 2000 . X. Y. M. Wang and M. Sarrafzadeh. Dragon2000: Standard-cell placement tool for large industry circuits. In Proc. ICCAD, pages 260--263, 2000."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055182"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055184"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382642"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289078"}],"event":{"name":"ISPD06: International Symposium on Physical Design 2006","sponsor":["ACM Association for Computing Machinery","SIGDA ACM Special Interest Group on Design Automation"],"location":"San Jose California USA","acronym":"ISPD06"},"container-title":["Proceedings of the 2006 international symposium on Physical design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1123008.1123051","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1123008.1123051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:10Z","timestamp":1750259170000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1123008.1123051"}},"subtitle":["a net-reduction based clustering preprocessing algorithm"],"short-title":[],"issued":{"date-parts":[[2006,4,9]]},"references-count":21,"alternative-id":["10.1145\/1123008.1123051","10.1145\/1123008"],"URL":"https:\/\/doi.org\/10.1145\/1123008.1123051","relation":{},"subject":[],"published":{"date-parts":[[2006,4,9]]},"assertion":[{"value":"2006-04-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}