{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:30:40Z","timestamp":1757626240857,"version":"3.44.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1016\/0167-9260(93)90058-k","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"59-74","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Necessary and sufficient conditions for the routability of classical channels"],"prefix":"10.1016","volume":"16","author":[{"given":"Patrick","family":"Groeneveld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(93)90058-K_BIB1","series-title":"Proc. 20th Design Automation Conference","first-page":"591","article-title":"Hierarchical channel router","author":"Burstein","year":"1983"},{"key":"10.1016\/0167-9260(93)90058-K_BIB2","series-title":"Proc. 13th Design Automation Conference","first-page":"425","article-title":"A dogleg channel router","author":"Deutsch","year":"1976"},{"issue":"4","key":"10.1016\/0167-9260(93)90058-K_BIB3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/43.29597","article-title":"Two new and more difficult channel routing problems","volume":"CAD-8","author":"Deutsch","year":"1989","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"12","key":"10.1016\/0167-9260(93)90058-K_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/43.62773","article-title":"A multiple-layer contour-based gridless channel router","volume":"CAD-9","author":"Groeneveld","year":"1990","journal-title":"IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems"},{"key":"10.1016\/0167-9260(93)90058-K_BIB5","series-title":"Proc. International Workshop on Layout Synthesis","first-page":"3","article-title":"Macro-cell style routing on sea-of-gates with 100% completion guarantee","author":"Groeneveld","year":"1992"},{"key":"10.1016\/0167-9260(93)90058-K_BIB6","series-title":"Proc. 8th Design Automation Conference","first-page":"155","article-title":"Wire routing by optimizing channel assignment within large apertures","author":"Hashimoto","year":"1971"},{"year":"1980","author":"LaPaugh","article-title":"Algorithms for integrated circuit layout: an analytical approach","key":"10.1016\/0167-9260(93)90058-K_BIB7"},{"key":"10.1016\/0167-9260(93)90058-K_BIB8","series-title":"Proc. 19th Design Automation Conference","first-page":"418","article-title":"A greedy channel router","author":"Rivest","year":"1982"},{"issue":"6","key":"10.1016\/0167-9260(93)90058-K_BIB9","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TCAD.1987.1270336","article-title":"A detailed router based on incremental routing modifications: mighty","volume":"CAD-6","author":"Shin","year":"1987","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"1","key":"10.1016\/0167-9260(93)90058-K_BIB10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/TCAD.1985.1270096","article-title":"Dogleg channel routing is np-complete","volume":"CAD-4","author":"Szymanski","year":"1985","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"1","key":"10.1016\/0167-9260(93)90058-K_BIB11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TCAD.1982.1269993","article-title":"Efficient algorithms for channel routing","volume":"CAD-1","author":"Yoshimura","year":"1982","journal-title":"IEEE Transactions on Computer-Aided Design"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609390058K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016792609390058K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:53Z","timestamp":1757453873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016792609390058K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["016792609390058K"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(93)90058-k","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1993,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Necessary and sufficient conditions for the routability of classical channels","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(93)90058-K","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}