{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:52:40Z","timestamp":1759146760147,"version":"3.44.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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,8]]},"DOI":"10.1016\/0167-9260(89)90034-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"127-149","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["A reconfigurable wiring algorithm for three-layer maze routing"],"prefix":"10.1016","volume":"7","author":[{"given":"F.","family":"Curatelli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Antognetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-9260(89)90034-5_BIB1","series-title":"Proc. 11th European Solid State Circuits Conf.","first-page":"193","article-title":"ARIANNAL: A floor-planning tool","author":"Antognetti","year":"1985"},{"key":"10.1016\/0167-9260(89)90034-5_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TCAD.1983.1270040","article-title":"Hierarchical wire routing","volume":"CAD-2","author":"Burstein","year":"1983","journal-title":"IEEE Trans. Comput.-Aided-Des."},{"key":"10.1016\/0167-9260(89)90034-5_BIB3","series-title":"Proc. ICCAD-85","first-page":"304","article-title":"A variable-width gridless channel router","author":"Chen","year":"1985"},{"key":"10.1016\/0167-9260(89)90034-5_BIB4","series-title":"Proc. ICCAD-85","first-page":"223","article-title":"Compacted channel routing","author":"Deutsch","year":"1985"},{"key":"10.1016\/0167-9260(89)90034-5_BIB5","series-title":"Proc. 21st Design Automation Conf.","first-page":"173","article-title":"A switchbox router with obstacle avoidance","author":"Hamachi","year":"1984"},{"key":"10.1016\/0167-9260(89)90034-5_BIB6","series-title":"Proc. 17th Design Automation Conf.","first-page":"243","article-title":"A line-expansion algorithm for the general routing problem with a guaranteed solution","author":"Heyns","year":"1980"},{"key":"10.1016\/0167-9260(89)90034-5_BIB7","series-title":"Proc. 6th Design Automation Workshop","first-page":"1","article-title":"A solution to the routing problems on the continuous plane","author":"Hightower","year":"1969"},{"key":"10.1016\/0167-9260(89)90034-5_BIB8","article-title":"A placement\/interconnect channel router: cutting your PI into slices","author":"Koschella","year":"1983","journal-title":"MIT\/VLSI memo 83-157"},{"key":"10.1016\/0167-9260(89)90034-5_BIB9","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","article-title":"An algorithm for path connection and its applications","author":"Lee","year":"1961","journal-title":"IRE Trans. Elec. Comput."},{"key":"10.1016\/0167-9260(89)90034-5_BIB10","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1109\/TCAD.1987.1270299","article-title":"A tile expansion router","volume":"CAD-6","author":"Margarino","year":"1987","journal-title":"IEEE Trans. Comput.-Aided-Des."},{"year":"1980","series-title":"Introduction to VLSI Systems","author":"Mead","key":"10.1016\/0167-9260(89)90034-5_BIB11"},{"key":"10.1016\/0167-9260(89)90034-5_BIB12","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":"CAD-3","author":"Ousterhout","year":"1984","journal-title":"IEEE Trans. Comput-Aided-Des."},{"key":"10.1016\/0167-9260(89)90034-5_BIB13","article-title":"The impact of layer assignment methods on layout algorithms for IC","author":"Pinter","year":"1983","journal-title":"MIT\/VLSI memo 82-130"},{"key":"10.1016\/0167-9260(89)90034-5_BIB14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TCAD.1985.1270117","article-title":"A new symbolic channel router: YACR2","volume":"CAD-4","author":"Reed","year":"1985","journal-title":"IEEE Trans. Comput-Aided-Des."},{"key":"10.1016\/0167-9260(89)90034-5_BIB15","series-title":"Proc. 19th Design Automation Conf.","first-page":"418","article-title":"A greedy channel router","author":"Rivest","year":"1982"},{"key":"10.1016\/0167-9260(89)90034-5_BIB16","series-title":"Proc. 23th Design Automation Conf.","first-page":"2","article-title":"MIGHTY: a rip-up and reroute detailed router","author":"Shin","year":"1985"},{"key":"10.1016\/0167-9260(89)90034-5_BIB17","series-title":"Proc. IEEE","first-page":"1281","article-title":"Circuit layout","author":"Soukup","year":"1981"},{"year":"1984","series-title":"Computational Aspects of VLSI","author":"Ullman","key":"10.1016\/0167-9260(89)90034-5_BIB18"},{"key":"10.1016\/0167-9260(89)90034-5_BIB19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/TCAD.1983.1270039","article-title":"Global wiring by simulated annealing","volume":"CAD-2","author":"Vecchi","year":"1983","journal-title":"IEEE Trans. Comput.-Aided-Des."}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900345?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167926089900345?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:14Z","timestamp":1757453834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167926089900345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["0167926089900345"],"URL":"https:\/\/doi.org\/10.1016\/0167-9260(89)90034-5","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1989,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A reconfigurable wiring algorithm for three-layer maze routing","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0167-9260(89)90034-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"}]}}