{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:33Z","timestamp":1759190793671,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["MIP 8921540","DCR 8420814","MIP 8709074"],"award-info":[{"award-number":["MIP 8921540","DCR 8420814","MIP 8709074"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/s0167-9260(05)80033-1","type":"journal-article","created":{"date-parts":[[2006,12,19]],"date-time":"2006-12-19T09:32:05Z","timestamp":1166520725000},"page":"19-37","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["Planar subset of multi-terminal nets"],"prefix":"10.1016","volume":"10","author":[{"given":"K.F.","family":"Liao","sequence":"first","affiliation":[]},{"given":"D.T.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sarrafzadeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0167-9260(05)80033-1_bib1","first-page":"550","article-title":"A unified approach to layout wirability","volume":"19","author":"Lipski","year":"1987","journal-title":"Mathematical Systems Theory"},{"issue":"2","key":"10.1016\/S0167-9260(05)80033-1_bib2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF01553888","article-title":"An efficient algorithm for maxdominance, with application","volume":"4","author":"Atallah","year":"1989","journal-title":"Algorithmica"},{"article-title":"Circle graphs","year":"1980","author":"Buckingham","key":"10.1016\/S0167-9260(05)80033-1_bib3"},{"issue":"5","key":"10.1016\/S0167-9260(05)80033-1_bib4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","article-title":"Optimal three-layer channel routing","volume":"C-33","author":"Preparata","year":"1984","journal-title":"IEEE Trans. on Computers"},{"issue":"4","key":"10.1016\/S0167-9260(05)80033-1_bib5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TCAD.1987.1270298","article-title":"On the complexity of the general routing problem in the knock-knee mode","volume":"CAD-6","author":"Sarrafzadeh","year":"1987","journal-title":"IEEE Trans. on Computer-Aided Design"},{"article-title":"Wire-routing is NP-complete","year":"1982","author":"Kramer","key":"10.1016\/S0167-9260(05)80033-1_bib6"},{"key":"10.1016\/S0167-9260(05)80033-1_bib7","first-page":"69","article-title":"Algorithms for routing and testing routability of planar VLSI layouts","author":"Leiserson","year":"1985","journal-title":"STOC"},{"issue":"4","key":"10.1016\/S0167-9260(05)80033-1_bib8","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TCAD.1983.1270042","article-title":"Single-layer routing for VLSI: Analysis and algorithms","volume":"CAD-2","author":"Marek-Sadowska","year":"1983","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"10.1016\/S0167-9260(05)80033-1_bib9","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1002\/net.3230120307","article-title":"Double row planar routing and permutation layout","volume":"12","author":"Tsukiyama","year":"1982","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0167-9260(05)80033-1_bib10","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1137\/0215033","article-title":"Efficient algorithms for geometric graph search problem","volume":"15","author":"Imai","year":"1986","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/S0167-9260(05)80033-1_bib11","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/TCAD.1987.1270302","article-title":"Pad assignment for power nets in VLSI","volume":"CAD-6","author":"Marek-Sadowska","year":"1987","journal-title":"IEEE Trans. on Computer-Aided Design"},{"key":"10.1016\/S0167-9260(05)80033-1_bib12","first-page":"53","article-title":"Single layer routing of power and ground networks in ICs","volume":"1","author":"Syed","year":"1982","journal-title":"J. Digital Systems"},{"issue":"2","key":"10.1016\/S0167-9260(05)80033-1_bib13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01840443","article-title":"Channel routing in knock-knee mode: Simplified algorithms and proofs","volume":"1","author":"Mehlhorn","year":"1986","journal-title":"Algorithmica"},{"year":"1985","series-title":"Computational Geometry","author":"Preparata","key":"10.1016\/S0167-9260(05)80033-1_bib14"},{"issue":"1","key":"10.1016\/S0167-9260(05)80033-1_bib15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TCAD.1987.1270250","article-title":"Finding a maximum planar subset of a set of nets in a channel","volume":"CAD-6","author":"Supowit","year":"1987","journal-title":"IEEE Trans. on Computer-Aided Design"},{"issue":"2","key":"10.1016\/S0167-9260(05)80033-1_bib16","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/5383.5387","article-title":"Partitioning a polygonal region into trapezoids","volume":"33","author":"Asano","year":"1986","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0167-9260(05)80033-1_bib17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their use","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J. on Computing"},{"issue":"8","key":"10.1016\/S0167-9260(05)80033-1_bib18","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1109\/43.31548","article-title":"A new approach to topological via minimization","volume":"CAD-8","author":"Sarrafzadeh","year":"1989","journal-title":"IEEE Trans. on Computer-Aided Design"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","key":"10.1016\/S0167-9260(05)80033-1_bib19"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926005800331?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926005800331?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:12:08Z","timestamp":1759137128000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926005800331"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["S0167926005800331"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(05)80033-1","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1990,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Planar subset of multi-terminal nets","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(05)80033-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}