{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T16:13:47Z","timestamp":1774800827455,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2012,2,1]],"date-time":"2012-02-01T00:00:00Z","timestamp":1328054400000},"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,2]]},"DOI":"10.1109\/tcad.2011.2169258","type":"journal-article","created":{"date-parts":[[2012,1,30]],"date-time":"2012-01-30T21:18:53Z","timestamp":1327958333000},"page":"285-293","source":"Crossref","is-referenced-by-count":29,"title":["Correctly Modeling the Diagonal Capacity in Escape Routing"],"prefix":"10.1109","volume":"31","author":[{"given":"Tan","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-46632-0_40","article-title":"A faster algorithm for finding disjoint paths in grids","author":"chan","year":"1999","journal-title":"Proc Int Symp Algorithms and Computation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.1995.486224"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1531542.1531591"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1145\/1278480.1278633","article-title":"an integer linear programming based routing algorithm for flip-chip design","author":"jia-wei fang","year":"2007","journal-title":"2007 44th ACM\/IEEE Design Automation Conference DAC"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.870064"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055146"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2006.1594758"},{"key":"ref17","first-page":"244","article-title":"Ordered escape routing based on Boolean satisfiability","author":"luo","year":"2008","journal-title":"Proc Asia South Pacific Des Autom Conf"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382689"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907274"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1054"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2043586"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233668"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2005.1560165"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.1999.759779"},{"key":"ref7","first-page":"581","article-title":"Single-layer fanout routing and routability analysis for ball grid arrays","author":"yu","year":"1995","journal-title":"Proc Int Conf Comput -Aided Des"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.891364"},{"key":"ref9","first-page":"668","article-title":"Interchangeable pin routing with application to package layout","author":"yu","year":"1996","journal-title":"Proc Int Conf Comput -Aided Des"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1145\/1629911.1630001","article-title":"a correct network flow model for escape routing","author":"tan yan","year":"2009","journal-title":"2009 46th ACM\/IEEE Design Automation Conference dac"},{"key":"ref20","first-page":"606","article-title":"A negotiated congestion based router for simultaneous escape routing","author":"ma","year":"2010","journal-title":"Proc Int Symp Qual Electron Des"},{"key":"ref22","author":"staepelaere","year":"1992","journal-title":"Geometric Transformations for a Rubber-Band Sketch"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1735023.1735033"},{"key":"ref24","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/54.245960"},{"key":"ref25","author":"cherkassky","year":"1997","journal-title":"CS2 Min-cost flow solver"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/6132613\/06132657.pdf?arnumber=6132657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:47:17Z","timestamp":1633909637000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6132657\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":25,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2011.2169258","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}