{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:47:07Z","timestamp":1787500027203,"version":"build-2736575974"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1109\/tcad.2011.2170567","type":"journal-article","created":{"date-parts":[[2011,12,22]],"date-time":"2011-12-22T15:30:55Z","timestamp":1324567855000},"page":"50-60","source":"Crossref","is-referenced-by-count":129,"title":["SimPL: An Effective Placement Algorithm"],"prefix":"10.1109","volume":"31","author":[{"given":"Myung-Chul","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong-Jin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Igor L.","family":"Markov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","first-page":"1","author":"wright","year":"1987","journal-title":"Primal-Dual Interior-Point Methods"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/1278480.1278599","article-title":"rql: global placement via relaxed quadratic spreading and linearization","author":"viswanathan","year":"2007","journal-title":"2007 44th ACM\/IEEE Design Automation Conference DAC"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2008.41"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/99.660313"},{"key":"ref12","first-page":"2","article-title":"Sparse matrix computations on manycore GPU's","author":"garland","year":"2010","journal-title":"Proc DAC"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/1105734.1105739","article-title":"Exploring the cache design space for large scale CMPs","volume":"33","author":"hsu","year":"2005","journal-title":"ACM SIGARCH Comput Architect News"},{"key":"ref14","first-page":"161","article-title":"FAR: Fixed-points addition and relaxation based placement","author":"hu","year":"2005","journal-title":"Proc ISPD"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2009.4796484"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123057"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.862748"},{"key":"ref19","first-page":"249","article-title":"Parallel shortest path algorithms for solving large-scale instances","author":"madduri","year":"2006","journal-title":"Proc 9th DIMACS Implementat Challenge The Shortest Path Problem"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.927674"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.925783"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337549"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357975"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1561\/9781601982179","author":"buchbinder","year":"2009","journal-title":"The Design of Competitive Online Algorithms Via a Primal-Dual Approach"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923063"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123055"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.818126"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.859519"},{"key":"ref1","author":"adya","year":"2005","journal-title":"Executable Placement Utilities"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/TCAD.2006.870079","article-title":"A fast hierarchical quadratic placement algorithm","volume":"25","author":"nam","year":"2006","journal-title":"IEEE Trans Comput -Aided Des"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560039"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68739-1","author":"nam","year":"2007","journal-title":"Modern Circuit Placement Best Practices and Results"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907271"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/40.865866"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718003"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055184"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/6106029\/06106735.pdf?arnumber=6106735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T19:47:20Z","timestamp":1633895240000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6106735\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":31,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2011.2170567","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}