{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:51:14Z","timestamp":1761630674076,"version":"3.37.3"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"IBM"},{"name":"SpringSoft"},{"DOI":"10.13039\/501100004368","name":"TSMC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004368","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001869","name":"Academia Sinica","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001869","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSC of Taiwan","award":["NSC 101-2221-E-002-191-MY3","NSC100-2221-E-002-088-MY3","NSC 99-2221-E-002-207-MY3","Grant NSC 99-2221-E-002-210-MY3"],"award-info":[{"award-number":["NSC 101-2221-E-002-191-MY3","NSC100-2221-E-002-088-MY3","NSC 99-2221-E-002-207-MY3","Grant NSC 99-2221-E-002-210-MY3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1109\/tcad.2013.2285275","type":"journal-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T15:13:52Z","timestamp":1390576432000},"page":"224-236","source":"Crossref","is-referenced-by-count":7,"title":["Obstacle-Avoiding Free-Assignment Routing for Flip-Chip Designs"],"prefix":"10.1109","volume":"33","author":[{"family":"Yuan-Kai Ho","sequence":"first","affiliation":[]},{"family":"Hsu-Chieh Lee","sequence":"additional","affiliation":[]},{"given":"Webber","family":"Lee","sequence":"additional","affiliation":[]},{"family":"Yao-Wen Chang","sequence":"additional","affiliation":[]},{"family":"Chen-Feng Chang","sequence":"additional","affiliation":[]},{"family":"I-Jye Lin","sequence":"additional","affiliation":[]},{"family":"Chin-Fang Shen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"802","article-title":"Gridless routers-new wire routing algorithms based on computational geometry","author":"ohtsuki","year":"1985","journal-title":"Proc Int Conf Comput Sci"},{"key":"ref11","first-page":"176","article-title":"An optimal algorithm for layer assignment of bus escape routing on PCBs","author":"qiang","year":"2011","journal-title":"Proc ACM\/IEEE Design Autom Conf"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/54.245960"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.1999.759779"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233668"},{"key":"ref15","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":"ref16","first-page":"668","article-title":"Interchangeable pin routing with application to package layout","author":"yu","year":"1996","journal-title":"Proc IEEE\/ACM Int Conf Comput Aided Design"},{"journal-title":"Interchangeable pin routing with application to package layout","year":"1996","author":"yu","key":"ref17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2043586"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.891364"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2009151"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837298"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228558"},{"key":"ref2","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 Comput"},{"journal-title":"Network Flows Theory Algorithms and Applications","year":"1993","author":"ahuja","key":"ref1"},{"journal-title":"Single-Layer Wire Routing and Compaction","year":"1990","author":"maley","key":"ref9"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6714471\/06714620.pdf?arnumber=6714620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:32Z","timestamp":1641987092000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6714620\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2]]},"references-count":17,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2013.2285275","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"type":"print","value":"0278-0070"},{"type":"electronic","value":"1937-4151"}],"subject":[],"published":{"date-parts":[[2014,2]]}}}