{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:22:52Z","timestamp":1649064172085},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7563,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0166-218x(92)90022-3","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"73-81","source":"Crossref","is-referenced-by-count":1,"title":["An efficient parallel logarithmic time algorithm for the channel routing problem"],"prefix":"10.1016","volume":"40","author":[{"given":"Dorothea","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90022-3_BIB1","series-title":"Advances in Computing Research Vol. 2, VLSI Theory","first-page":"245","article-title":"VLSI routing: Four layers are enough","author":"Brady","year":"1984"},{"key":"10.1016\/0166-218X(92)90022-3_BIB2","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1137\/0220014","article-title":"Parallel algorithms for channel routing in the knock-knee model","volume":"20","author":"Chang","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90022-3_BIB3","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1983.1676223","article-title":"Binary trees and parallel scheduling algorithms","volume":"32","author":"Dekel","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90022-3_BIB4","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978","journal-title":"Proceedings of the 10th ACM Annual Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(92)90022-3_BIB5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","article-title":"Disjoint paths in a rectilinear grid","volume":"2","author":"Frank","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(92)90022-3_BIB6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0166-218X(86)90057-0","article-title":"An introduction to parallelism in combinatorial optim ization","volume":"14","author":"Kindervater","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(92)90022-3_BIB7","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/SFCS.1989.63526","article-title":"Area-optimal three-layer channel routing","author":"Kuchem","year":"1989","journal-title":"Proceedings of the IEEE Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(92)90022-3_BIB8","series-title":"Advances in Computing Research","first-page":"231","article-title":"On the structure of three-layer wireable layouts","author":"Lipski","year":"1984"},{"key":"10.1016\/0166-218X(92)90022-3_BIB9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","article-title":"Routing through a rectangle","volume":"33","author":"Mehlhorn","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90022-3_BIB10","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","article-title":"On the structure of three-layer wireable layouts","volume":"33","author":"Preparata","year":"1984","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:50Z","timestamp":1554967430000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92900223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0166218X92900223"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90022-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}