{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T11:56:58Z","timestamp":1792756618307,"version":"4.5.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"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":[[2013,5]]},"DOI":"10.1109\/tcad.2012.2235124","type":"journal-article","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T18:09:28Z","timestamp":1366222168000},"page":"709-722","source":"Crossref","is-referenced-by-count":140,"title":["NCTU-GR 2.0: Multithreaded Collision-Aware Global Routing With Bounded-Length Maze Routing"],"prefix":"10.1109","volume":"32","author":[{"family":"Wen-Hao Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Wei-Chun Kao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Yih-Lang Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Kai-Yuan Chao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837324"},{"key":"ref10","first-page":"503","article-title":"BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router","author":"cho","year":"2007","journal-title":"Proc ICCAD"},{"key":"ref11","first-page":"488","article-title":"ARCHER: A history-driven global routing algorithm","author":"ozdal","year":"2007","journal-title":"Proc ICCAD"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061590"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2009.4796543"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2006.320159"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357994"},{"key":"ref16","first-page":"576","article-title":"FastRoute 4.0: Global router with efficient via minimization","author":"xu","year":"2009","journal-title":"Proc ASP-DAC"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2010.2102780"},{"key":"ref18","first-page":"320","article-title":"GRIP: Scalable 3-D global routing using integer programming","author":"wu","year":"2009","journal-title":"Proc DAC"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837323"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722248"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687467"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"ref3","first-page":"67","article-title":"IPR: An integrated placement and routing algorithm","author":"pan","year":"2007","journal-title":"Proc DAC"},{"key":"ref6","year":"2008","journal-title":"ISPD 2008 Contest"},{"key":"ref29","first-page":"197","article-title":"Coloring large graphs","author":"manvel","year":"1981","journal-title":"Proc Southeastern Conf Graph Theory Combinatorics Comput Sci"},{"key":"ref5","author":"nam","year":"2007","journal-title":"ISPD 2007 Contest"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735035"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.923255"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105307"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2008.4483946"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687466"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2011.6105336"},{"key":"ref22","author":"muller","year":"2011","journal-title":"Mathematical Programming Computation"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/FPGA.1995.242049","article-title":"pathfinder: a negotiation-based performance-driven router for fpgas","author":"mcmurchie","year":"1995","journal-title":"Third International ACM Symposium on Field-Programmable Gate Arrays"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391502"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90020-5"},{"key":"ref25","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6504524\/06504553.pdf?arnumber=6504553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:25Z","timestamp":1638218425000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6504553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2012.2235124","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}