{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:40:13Z","timestamp":1759138813828,"version":"3.44.0"},"reference-count":40,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1016\/j.vlsi.2008.09.003","type":"journal-article","created":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T05:18:47Z","timestamp":1222838327000},"page":"262-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Solving modern mixed-size placement instances"],"prefix":"10.1016","volume":"42","author":[{"given":"Jarrod A.","family":"Roy","sequence":"first","affiliation":[]},{"given":"Aaron N.","family":"Ng","sequence":"additional","affiliation":[]},{"given":"Rajat","family":"Aggarwal","sequence":"additional","affiliation":[]},{"given":"Venky","family":"Ramachandran","sequence":"additional","affiliation":[]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.vlsi.2008.09.003_bib1","doi-asserted-by":"crossref","unstructured":"G.-J. Nam, C.J. Alpert, P. Villarrubia, B. Winter, M.C. Yildiz, The ISPD2005 placement contest and benchmark suite, ISPD, pp. 216\u2013220, 2005.","DOI":"10.1145\/1055137.1055182"},{"issue":"7","key":"10.1016\/j.vlsi.2008.09.003_bib2","first-page":"1313","article-title":"Min-cut floorplacement","volume":"25","author":"Roy","year":"2006","journal-title":"IEEE TCAD"},{"key":"10.1016\/j.vlsi.2008.09.003_bib3","doi-asserted-by":"crossref","unstructured":"A.E. Caldwell, A.B. Kahng, I.L. Markov, Can recursive bisection alone produce routable placements?, DAC 2000, pp. 477\u2013482.","DOI":"10.1145\/337292.337549"},{"key":"10.1016\/j.vlsi.2008.09.003_bib4","doi-asserted-by":"crossref","unstructured":"A.B. Kahng, Classical floorplanning harmful? ISPD 2000, pp. 207\u2013213.","DOI":"10.1145\/332357.332401"},{"key":"10.1016\/j.vlsi.2008.09.003_bib5","doi-asserted-by":"crossref","unstructured":"H. Murata, K. Fujiyoshi, S. Nakatake, Y. Kajitani, Rectangle-packing-based module placement, ICCAD 1995, pp. 472\u2013479.","DOI":"10.1109\/ICCAD.1995.480159"},{"key":"10.1016\/j.vlsi.2008.09.003_bib6","doi-asserted-by":"crossref","unstructured":"Yi.-C. Chang, Y.-W. Chang, G.-M. Wu, S.-W. Wu, B*-trees: a new representation for non-slicing floorplans, DAC 2000, pp. 458\u2013463.","DOI":"10.1145\/337292.337541"},{"key":"10.1016\/j.vlsi.2008.09.003_bib7","doi-asserted-by":"crossref","unstructured":"H.H. Chan, S.N. Adya, I.L. Markov, are floorplan representations useful in digital design?, ISPD 2005, pp. 129\u2013136.","DOI":"10.1145\/1055137.1055164"},{"key":"10.1016\/j.vlsi.2008.09.003_bib8","doi-asserted-by":"crossref","unstructured":"S.N. Adya, I.L. Markov, Fixed-outline floorplanning: enabling hierarchical design, TVLSI 2003, pp. 1120\u20131135 \u3008http:\/\/vlsicad.eecs.umich.edu\/BK\/parquet\/\u3009.","DOI":"10.1109\/TVLSI.2003.817546"},{"key":"10.1016\/j.vlsi.2008.09.003_bib9","doi-asserted-by":"crossref","unstructured":"C.J. Alpter, D. Mehta, S. Sapatnekar (Eds.), Handbook of Algorithms for VLSI Physical Design Automation, CRC Press, Boca Raton, 2007.","DOI":"10.1201\/9781420013481"},{"key":"10.1016\/j.vlsi.2008.09.003_bib10","doi-asserted-by":"crossref","unstructured":"G.-J. Nam, J. Cong (Eds.), Modern Circuit Placement: Best Practices and Results, Springer, Berlin, 2007.","DOI":"10.1007\/978-0-387-68739-1"},{"key":"10.1016\/j.vlsi.2008.09.003_bib11","doi-asserted-by":"crossref","unstructured":"J. Cong, M. Romesis, J. Shinnerl, Fast floorplanning by look-ahead enabled recursive bipartitioning, ASPDAC IEEE TCAD 2006, pp. 1719\u20131732.","DOI":"10.1109\/TCAD.2005.859519"},{"key":"10.1016\/j.vlsi.2008.09.003_bib12","doi-asserted-by":"crossref","unstructured":"J. Cong, G. Nataneli, M. Romesis, J.R. Shinnerl, An area-optimality study of floorplanning, ISPD 2004, pp. 78\u201383.","DOI":"10.1145\/981066.981083"},{"key":"10.1016\/j.vlsi.2008.09.003_bib13","doi-asserted-by":"crossref","unstructured":"G. Karypis, R. Aggarwal, V. Kumar, S. Shekar, Multilevel hypergraph partitioning: applications in VLSI design, DAC 1997, pp. 526\u2013529.","DOI":"10.1145\/266021.266273"},{"key":"10.1016\/j.vlsi.2008.09.003_bib14","unstructured":"J. Cong, M. Romesis, J.R. Shinnerl, Robust mixed-size placement under Tight white-space constraints, ICCAD 2005."},{"key":"10.1016\/j.vlsi.2008.09.003_bib15","unstructured":"T.-C. Chen, Y.-W. Chang, S.-C. Lin, IMF: interconnect-driven multilevel floorplanning for large-scale building-module designs, ICCAD 2005, pp. 159\u2013164."},{"key":"10.1016\/j.vlsi.2008.09.003_bib16","doi-asserted-by":"crossref","unstructured":"A. Khatkhate, C. Li, A.R. Agnihotri, M.C. Yildiz, S. Ono, C.-K. Koh, P. Madden, Recursive bisection based mixed block placement, ISPD 2004, pp. 84\u201389.","DOI":"10.1145\/981066.981084"},{"key":"10.1016\/j.vlsi.2008.09.003_bib17","doi-asserted-by":"crossref","unstructured":"A.B. Kahng, Q. Wang, Implementation and extensibility of an analytic placer, ISPD 2004, pp. 18\u201325.","DOI":"10.1145\/981066.981071"},{"key":"10.1016\/j.vlsi.2008.09.003_bib18","doi-asserted-by":"crossref","unstructured":"A.B. Kahng, Q. Wang, An analytic placer for mixed-size placement and timing-driven placement, ICCAD 2004, pp. 565\u2013572.","DOI":"10.1109\/ICCAD.2004.1382641"},{"key":"10.1016\/j.vlsi.2008.09.003_bib19","unstructured":"X. Yang, B.-K. Choi, M. Sarrafzadeh, A standard-cell placement tool for designs with high row utilization, ICCD 2002, pp. 45\u201347."},{"key":"10.1016\/j.vlsi.2008.09.003_bib20","doi-asserted-by":"crossref","unstructured":"T. Taghavi, X. Yang, B.-K. Choi, Dragon2005: large-scale mixed-size placement tool, ISPD 2005, pp. 245\u2013247.","DOI":"10.1145\/1055137.1055191"},{"issue":"5","key":"10.1016\/j.vlsi.2008.09.003_bib21","first-page":"722","article-title":"Fastplace: efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model","volume":"24","author":"Viswanathan","year":"2005","journal-title":"IEEE TCAD"},{"key":"10.1016\/j.vlsi.2008.09.003_bib22","doi-asserted-by":"crossref","unstructured":"B. Yao, H. Chen, C.-K. Cheng, N.-C. Chou, L.-T. Liu, P. Suaris, Unified quadratic programming approach for mixed mode placement, ISPD 2005, pp. 193\u2013199.","DOI":"10.1145\/1055137.1055178"},{"key":"10.1016\/j.vlsi.2008.09.003_bib23","doi-asserted-by":"crossref","unstructured":"K. Vorwerk, A. Kennings, An improved multi-level framework for force-directed placement, DATE 2005, pp. 902\u2013907.","DOI":"10.1109\/DATE.2005.59"},{"key":"10.1016\/j.vlsi.2008.09.003_bib24","doi-asserted-by":"crossref","unstructured":"C.-C. Chang, J. Cong, X. Yuan, Multi-level placement for large-scale mixed-size IC designs, ASPDAC 2003, pp. 325\u2013330.","DOI":"10.1145\/1119772.1119835"},{"key":"10.1016\/j.vlsi.2008.09.003_bib25","doi-asserted-by":"crossref","unstructured":"T.F. Chani, J. Cong, T. Kong, J.R. Shinnerl, K. Sze, An enhanced multilevel algorithm for circuit placement, ICCAD 2003, pp. 299\u2013306.","DOI":"10.1109\/ICCAD.2003.159704"},{"key":"10.1016\/j.vlsi.2008.09.003_bib26","unstructured":"\u3008http:\/\/vlsicad.eecs.umich.edu\/BK\/ISPD06bench\/\u3009."},{"key":"10.1016\/j.vlsi.2008.09.003_bib27","unstructured":"\u3008http:\/\/cadlab.cs.ucla.edu\/cpmo\/HBsuite.html\u3009."},{"key":"10.1016\/j.vlsi.2008.09.003_bib28","doi-asserted-by":"crossref","unstructured":"C.J. Alpert, The ISPD98 circuit benchmark suite, ISPD 1998, pp. 80\u201385.","DOI":"10.1145\/274535.274546"},{"key":"10.1016\/j.vlsi.2008.09.003_bib29","unstructured":"A.B. Kahng, S. Reda, Q. Wang, Architecture and details of a high quality, large-scale analytical placer, ICCAD 2005."},{"key":"10.1016\/j.vlsi.2008.09.003_bib30","doi-asserted-by":"crossref","unstructured":"H.-C. Lee, Y.-W. Chang, J.-M. Hsu, H.H. Yang, Multilevel floorplanning\/placement for large-scale modules using B*-trees, DAC 2003, pp. 812\u2013817.","DOI":"10.1145\/775832.776037"},{"key":"10.1016\/j.vlsi.2008.09.003_bib31","doi-asserted-by":"crossref","unstructured":"T.-C. Chen, Y.-W. Chang, Modern floorplanning based on fast simulated annealing, ISPD 2005, pp. 104\u2013112.","DOI":"10.1145\/1055137.1055161"},{"key":"10.1016\/j.vlsi.2008.09.003_bib32","doi-asserted-by":"crossref","unstructured":"A.N. Ng, R. Aggarwal, V. Ramachandran, I.L. Markov, solving hard instances of floorplacement, ISPD 2006, pp. 170\u2013177.","DOI":"10.1145\/1123008.1123047"},{"key":"10.1016\/j.vlsi.2008.09.003_bib33","doi-asserted-by":"crossref","unstructured":"G.-J. Nam, ISPD 2006 placement contest: benchmark suite and results, ISPD, 2006, p. 167.","DOI":"10.1145\/1123008.1123042"},{"issue":"10","key":"10.1016\/j.vlsi.2008.09.003_bib34","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1109\/TCAD.2003.818126","article-title":"Effective free space management for cut-based placement via analytical constraint generation","volume":"22","author":"Alpert","year":"2003","journal-title":"IEEE Trans. CAD"},{"key":"10.1016\/j.vlsi.2008.09.003_bib35","doi-asserted-by":"crossref","unstructured":"M.D. Moffitt, A.N. Ng, I.L. Markov, M.E. Pollack, Constraint-driven floorplan repair, DAC 2006, pp. 1103\u20131108.","DOI":"10.1145\/1146909.1147188"},{"key":"10.1016\/j.vlsi.2008.09.003_bib36","doi-asserted-by":"crossref","unstructured":"X. Tang, R. Tian, M.D.F. Wong, optimal redistribution of white space for wire length minimization, ASPDAC 2005, pp. 405\u2013411.","DOI":"10.1145\/1120725.1120900"},{"key":"10.1016\/j.vlsi.2008.09.003_bib37","doi-asserted-by":"crossref","unstructured":"S. Reda, A. Chowdhary, Effective linear programming based placement methods, ISPD 2006, pp. 186\u2013191.","DOI":"10.1145\/1123008.1123049"},{"key":"10.1016\/j.vlsi.2008.09.003_bib38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1995.0805","article-title":"An efficient implementation of a scaling minimum-cost flow algorithm","volume":"22","author":"Goldberg","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/j.vlsi.2008.09.003_bib39","doi-asserted-by":"crossref","unstructured":"J.A. Roy, D.A. Papa, S.N. Adya, H.H. Chan, A.N. Ng, J.F. Lu, I.L. Markov, Capo: robust and scalable open-source min-cut floorplacer, ISPD 2005, pp. 224\u2013227.","DOI":"10.1145\/1055137.1055184"},{"key":"10.1016\/j.vlsi.2008.09.003_bib40","unstructured":"D. Hill, Method and system for high speed detailed placement of cells within an integrated circuit design, US Patent 6370673, April 2002."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926008000461?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926008000461?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:14:29Z","timestamp":1759137269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926008000461"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["S0167926008000461"],"URL":"https:\/\/doi.org\/10.1016\/j.vlsi.2008.09.003","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2009,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Solving modern mixed-size placement instances","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.vlsi.2008.09.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2008 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}