{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:18Z","timestamp":1759063518968},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1109\/tcad.1985.1270095","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:28:59Z","timestamp":1083198539000},"page":"23-30","source":"Crossref","is-referenced-by-count":38,"title":["Channel Routing Algorithms for Overlap Models"],"prefix":"10.1109","volume":"4","author":[{"given":"S.E.","family":"Hambrusch","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Using overlap and minimizing contact points in channel routing","author":"hambrusch","year":"1983","journal-title":"Proc 21st Ann Allerton Conf on Comm Contr and Comp"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800146.804843"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676459"},{"key":"ref5","author":"leighton","year":"0","journal-title":"New Lower Bound for Channel Routing"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/800263.809239"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68402-9_18"},{"key":"ref2","first-page":"194","article-title":"Arbitrary planar routing with four layers","author":"brady","year":"1984","journal-title":"Proc Conf on Advanced Research in VLSI"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1982.1269993"},{"key":"ref1","author":"bolognesi","year":"0","journal-title":"A channel routing algorithm with bounded wire length"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/28431\/01270095.pdf?arnumber=1270095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:41Z","timestamp":1638218381000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1270095\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"URL":"https:\/\/doi.org\/10.1109\/tcad.1985.1270095","relation":{},"ISSN":["0278-0070"],"issn-type":[{"value":"0278-0070","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}