{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:31:06Z","timestamp":1757626266849,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":[[1989,9]]},"DOI":"10.1016\/0167-9260(89)90003-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"231-245","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast algorithm for optimal layer assignment"],"prefix":"10.1016","volume":"7","author":[{"given":"Y.S.","family":"Kuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.C.","family":"Chern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Kuan","family":"Shih","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(89)90003-5_BIB1","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/0206007","article-title":"Comments on F. Hadlock's paper: finding a maximum cut of a planar graph in polynomial time","volume":"6","author":"Aoshima","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/0167-9260(89)90003-5_BIB2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TCAD.1987.1270247","article-title":"Efficient algorithms for layer assignment problem","volume":"CAD-6","author":"Chang","year":"1987","journal-title":"IEEE Trans. Comput.-Aided Des"},{"issue":"5","key":"10.1016\/0167-9260(89)90003-5_BIB3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TCS.1983.1085357","article-title":"A graph-theoretic via minimization algorithm for two-layer printed circuit boards","volume":"CAS-30","author":"Chen","year":"1983","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1016\/0167-9260(89)90003-5_BIB4","series-title":"Proc. 18th Design Automation Conf.","first-page":"733","article-title":"An optimum layer assignment for routing in IC's and PCB's","author":"Ciesielski","year":"1981"},{"year":"1979","series-title":"Graph Algorithms","author":"Even","key":"10.1016\/0167-9260(89)90003-5_BIB5"},{"key":"10.1016\/0167-9260(89)90003-5_BIB6","series-title":"23rd annual Symposium on Foundations of Computer Science","first-page":"255","article-title":"Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs","author":"Galil","year":"1982"},{"year":"1979","series-title":"Computers and Intractability, A Guide to the Theory of NP-completeness","author":"Garey","key":"10.1016\/0167-9260(89)90003-5_BIB7"},{"issue":"3","key":"10.1016\/0167-9260(89)90003-5_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-9260(89)90003-5_BIB9","first-page":"155","article-title":"Wire routing by optimizing channel assignment within large apertures","author":"Hashimoto","year":"1971"},{"issue":"4","key":"10.1016\/0167-9260(89)90003-5_BIB10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"JACM"},{"issue":"4","key":"10.1016\/0167-9260(89)90003-5_BIB11","first-page":"235","article-title":"Minimum-via topological routing","volume":"CAD-2","author":"Hsu","year":"1983","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(89)90003-5_BIB12","first-page":"295","article-title":"On via hole minimization of routing in a 2-layer board","author":"Kajitani","year":"1980"},{"year":"1976","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","key":"10.1016\/0167-9260(89)90003-5_BIB13"},{"key":"10.1016\/0167-9260(89)90003-5_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0167-9260(89)90003-5_BIB15","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0167-9260(89)90003-5_BIB16","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TCAD.1984.1270074","article-title":"An unconstrained topological via minimization problem for two-layer routing","volume":"CAD-3","author":"Marek-Sadowska","year":"1984","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/0167-9260(89)90003-5_BIB17","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1137\/0215034","article-title":"Planar multicommodity flows, maximum matchings and negative cycles","volume":"15","author":"Matsumoto","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0167-9260(89)90003-5_BIB18","first-page":"123","article-title":"Optimal layer assignment of interconnect","volume":"1","author":"Pinter","year":"1984","journal-title":"J. VLSI Comput. Syst."},{"key":"10.1016\/0167-9260(89)90003-5_BIB19","series-title":"Proc. Int. Symp. on Circuits and Systems","first-page":"689","article-title":"Global via elimination in generalized routing environment","author":"Stevens","year":"1979"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900035?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:36:52Z","timestamp":1757453812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926089900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0167926089900035"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(89)90003-5","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1989,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast algorithm for optimal layer assignment","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(89)90003-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}