{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:52:25Z","timestamp":1649130745704},"reference-count":15,"publisher":"Elsevier BV","issue":"7","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0010-4485(90)90107-n","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T09:47:17Z","timestamp":1047635237000},"page":"423-433","source":"Crossref","is-referenced-by-count":1,"title":["Generalized terminal connectivity problem for multilayer layout scheme"],"prefix":"10.1016","volume":"22","author":[{"given":"Chia-Chun","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sao-Jie","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu-Shiung","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0010-4485(90)90107-N_BIB1","series-title":"Joint Tech. Conf. on Circuits System Computers and Communications","first-page":"173","article-title":"Generalized terminal connectivity problem for multi-layer layout scheme","author":"Tsai","year":"1989"},{"issue":"No 1","key":"10.1016\/0010-4485(90)90107-N_BIB2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0010-4485(88)90139-X","article-title":"Automated placement and routing","volume":"Vol 20","author":"Brown","year":"1988","journal-title":"Comput.-Aided Des."},{"key":"10.1016\/0010-4485(90)90107-N_BIB3","series-title":"International Symp. on Circuits and System","first-page":"2189","article-title":"Automatic multilayer routing for surface mounted technology","author":"Mueller","year":"1988"},{"key":"10.1016\/0010-4485(90)90107-N_BIB4","first-page":"1281","article-title":"Circuit layout","volume":"Vol 69","author":"Soukup","year":"1981"},{"key":"10.1016\/0010-4485(90)90107-N_BIB5","series-title":"Proc. 21st Des. Automation Conf.","first-page":"166","article-title":"Plowing: Interactive stretching and compaction in MAGIC","author":"Scott","year":"1984"},{"key":"10.1016\/0010-4485(90)90107-N_BIB6","series-title":"Proc. 22nd Des. Automation Conf.","first-page":"396","article-title":"A subjective review of compaction","author":"Chow","year":"1985"},{"key":"10.1016\/0010-4485(90)90107-N_BIB7","series-title":"Proc. 25th Des. Automation Conf.","first-page":"573","article-title":"The constrained via minimization problem for PCB and VLSI design","author":"Xiong","year":"1988"},{"key":"10.1016\/0010-4485(90)90107-N_BIB8","series-title":"Proc. 16th Des. Automation Conf.","first-page":"461","article-title":"Topological analysis for VLSI circuits","author":"Losleben","year":"1979"},{"key":"10.1016\/0010-4485(90)90107-N_BIB9","series-title":"Proc. 19th Des. Automation Conf.","first-page":"544","article-title":"Programs for verifying circuit connectivity of MOS\/LSI mask artwork","author":"Takashima","year":"1982"},{"key":"10.1016\/0010-4485(90)90107-N_BIB10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1002\/net.3230130308","article-title":"Finding a Manhattan path and related problems","volume":"Vol 13","author":"Lipski","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0010-4485(90)90107-N_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(84)90105-4","article-title":"An O(nlog n) Manhattan path algorithm","volume":"Vol 19","author":"Lipski","year":"1984","journal-title":"Inform. Process. Lett."},{"issue":"No 7","key":"10.1016\/0010-4485(90)90107-N_BIB12","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1109\/43.3950","article-title":"Generalized Manhattan path algorithm with applications'","volume":"Vol 7","author":"Asano","year":"1988","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0010-4485(90)90107-N_BIB13","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"issue":"No 1","key":"10.1016\/0010-4485(90)90107-N_BIB14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/TCAD.1984.1270061","article-title":"Corner stitching: A data-structuring technique for VLSI layout tools","volume":"Vol 3","author":"Ousterhout","year":"1984","journal-title":"IEEE Trans. on CAD"},{"key":"10.1016\/0010-4485(90)90107-N_BIB15","series-title":"Graph theory with applications to engineering and computer science","author":"Deo","year":"1974"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:001044859090107N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:001044859090107N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:58:47Z","timestamp":1553615927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/001044859090107N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":15,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["001044859090107N"],"URL":"https:\/\/doi.org\/10.1016\/0010-4485(90)90107-n","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}