{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T23:10:20Z","timestamp":1705965020185},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1109\/tcad.2016.2585761","type":"journal-article","created":{"date-parts":[[2016,6,28]],"date-time":"2016-06-28T18:18:57Z","timestamp":1467137937000},"page":"1-1","source":"Crossref","is-referenced-by-count":3,"title":["Finding Maximum Disjoint Set of Boundary Rectangles with Application to PCB Routing"],"prefix":"10.1109","author":[{"given":"Amirmahdi","family":"Ahmadinejad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(83)90012-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1837274.1837326"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630000"},{"key":"ref13","first-page":"390","article-title":"Optimal bus sequencing for escape routing in dense PCBs","author":"kong","year":"2007","journal-title":"Proc IEEE\/ACM Int Conf Comput -Aided Design (ICCAD)"},{"key":"ref14","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 (ASP-DAC)"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1109\/TCAD.2012.2193581","article-title":"NP-completeness and an approximation algorithm for rectangle escape problem with application to PCB routing","volume":"31","author":"ma","year":"2012","journal-title":"IEEE Trans Comput -Aided Design Integr Circuits Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024764"},{"key":"ref17","first-page":"51","article-title":"A note on maximum weight independent set in outer-rectangle graphs","volume":"36","author":"piliposyan","year":"2012","journal-title":"Probabilistic Methods in Computational Science"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233668"},{"key":"ref19","first-page":"181","article-title":"An ILP-based automatic bus planner for dense PCBs","author":"wu","year":"2013","journal-title":"Proc Asia and South Pacific Design Autom Conf (ASPDAC)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1054"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9417-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.891364"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402676"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90111-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00294-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.97"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/262839.263082"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1687399.1687444"},{"key":"ref22","first-page":"581","article-title":"Single-layer fanout routing and routability analysis for ball grid arrays","author":"yu","year":"1995","journal-title":"Proc IEEE\/ACM Int Conf Comput -Aided Design (ICCAD)"},{"key":"ref21","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"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/43\/6917053\/07501613.pdf?arnumber=7501613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:38:10Z","timestamp":1642005490000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7501613\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/tcad.2016.2585761","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}