{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:53:40Z","timestamp":1780674820582,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,25]],"date-time":"2012-03-25T00:00:00Z","timestamp":1332633600000},"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":[[2012,3,25]]},"DOI":"10.1145\/2160916.2160958","type":"proceedings-article","created":{"date-parts":[[2012,3,27]],"date-time":"2012-03-27T15:17:28Z","timestamp":1332861448000},"page":"193-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":69,"title":["MAPLE"],"prefix":"10.1145","author":[{"given":"Myung-Chul","family":"Kim","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natarajan","family":"Viswanathan","sequence":"additional","affiliation":[{"name":"IBM Corporation, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles J.","family":"Alpert","sequence":"additional","affiliation":[{"name":"IBM Corporation, Austin, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shyam","family":"Ramji","sequence":"additional","affiliation":[{"name":"IBM Corporation, Hopewell Junction, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,3,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"S. N. Adya I. L. Markov \"Executable Placement Utilities \" http:\/\/vlsicad.eecs.umich.edu\/BK\/PlaceUtils\/  S. N. Adya I. L. Markov \"Executable Placement Utilities \" http:\/\/vlsicad.eecs.umich.edu\/BK\/PlaceUtils\/"},{"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.1109\/JPROC.2006.890096"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.784119"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.927674"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055177"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123055"},{"key":"e_1_3_2_1_8_1","first-page":"218","volume-title":"ICCAD","author":"Chen H.-C.","year":"2008","unstructured":"H.-C. Chen ICCAD 2008 , pp. 218 -- 223 . H.-C. Chen et al., \"Constraint Graph-based Macro Placement for Modern Mixed-size Circuit Designs,\" ICCAD 2008, pp. 218--223."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775832.776034"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923063"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.927760"},{"key":"e_1_3_2_1_12_1","first-page":"74","article-title":"Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement","author":"He X.","year":"2011","unstructured":"X. He , \" Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement ,\" ICCAD 2011 , pp. 74 -- 79 . X. He et al., \"Ripple: An Effective Routability-Driven Placer by Iterative Cell Movement,\" ICCAD 2011, pp. 74--79.","journal-title":"ICCAD"},{"key":"e_1_3_2_1_13_1","first-page":"80","volume-title":"ICCAD","author":"Hsu M.-K.","year":"2011","unstructured":"M.-K. Hsu ICCAD 2011 , pp. 80 -- 84 . M.-K. Hsu et al., \"Routability-Driven Analytical Placement for Mixed-Size Circuit Designs,\" ICCAD 2011, pp. 80--84."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055189"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.846366"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123057"},{"key":"e_1_3_2_1_17_1","first-page":"67","volume-title":"ICCAD","author":"Kim M.-C.","year":"2011","unstructured":"M.-C. Kim , J. Hu , I. L. Markov , \" A SimPLR Method for Routability-dri ven Placement ,\" ICCAD 2011 , pp. 67 -- 73 . M.-C. Kim, J. Hu, I. L. Markov, \"A SimPLR Method for Routability-driven Placement,\" ICCAD 2011, pp. 67--73."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2170567"},{"issue":"3","key":"e_1_3_2_1_19_1","first-page":"229","article-title":"Smoothening Max-terms and Analytical Minimization of Half Perimeter Wirelength","volume":"14","author":"Kennings A. A.","year":"2002","unstructured":"A. A. Kennings , I. L. Markov , \" Smoothening Max-terms and Analytical Minimization of Half Perimeter Wirelength ,\" VLSI Design 14 ( 3 ), 2002 , pp. 229 -- 237 . A. A. Kennings, I. L. Markov, \"Smoothening Max-terms and Analytical Minimization of Half Perimeter Wirelength,\" VLSI Design 14(3), 2002, pp. 229--237.","journal-title":"VLSI Design"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.67789"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2011.2173490"},{"key":"e_1_3_2_1_22_1","volume-title":"Best Practices and Results,\" Springer","author":"Nam G.-J.","year":"2007","unstructured":"G.-J. Nam , J. Cong , \"Modern Circuit Placement : Best Practices and Results,\" Springer , 2007 . G.-J. Nam, J. Cong, \"Modern Circuit Placement: Best Practices and Results,\" Springer, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123047"},{"key":"e_1_3_2_1_24_1","first-page":"48","volume-title":"ICCAD","author":"Pan M.","year":"2005","unstructured":"M. Pan , N. Viswanathan , C. Chu , \"An Efficient & Effective Detailed Placement Algorithm,\" ICCAD 2005 , pp. 48 -- 55 . M. Pan, N. Viswanathan, C. Chu, \"An Efficient & Effective Detailed Placement Algorithm,\" ICCAD 2005, pp. 48--55."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/127601.127707"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.925783"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1118299.1118354"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357975"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278599"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1960397.1960429"}],"event":{"name":"ISPD'12: International Symposium on Physical Design","location":"Napa California USA","acronym":"ISPD'12","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2012 ACM international symposium on International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2160916.2160958","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2160916.2160958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:05:49Z","timestamp":1750241149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2160916.2160958"}},"subtitle":["multilevel adaptive placement for mixed-size designs"],"short-title":[],"issued":{"date-parts":[[2012,3,25]]},"references-count":30,"alternative-id":["10.1145\/2160916.2160958","10.1145\/2160916"],"URL":"https:\/\/doi.org\/10.1145\/2160916.2160958","relation":{},"subject":[],"published":{"date-parts":[[2012,3,25]]},"assertion":[{"value":"2012-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}