{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:07:21Z","timestamp":1787501241231,"version":"build-2736575974"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01704913","type":"journal-article","created":{"date-parts":[[2005,6,10]],"date-time":"2005-06-10T13:03:11Z","timestamp":1118408591000},"page":"189-203","source":"Crossref","is-referenced-by-count":29,"title":["A unified approach to layout wirability"],"prefix":"10.1007","volume":"19","author":[{"suffix":"Jr.","given":"Witold","family":"Lipski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franco P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01704913_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-642-68402-9_18","volume-title":"VLSI Systems and Computations","author":"R. L. Rivest","year":"1981","unstructured":"R. L. Rivest, A. Baratz, and G. Miller, Provably good channel routing algorithms, inVLSI Systems and Computations (H. T. Kung, B. Sproull, and G. Steele, eds), Computer Science Press, Rockville, MD, 1981, pp. 153\u2013159."},{"key":"BF01704913_CR2","unstructured":"T. Bolognesi and D. J. Brown, A channel routing algorithm with bounded maximum wire length, Manuscript, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1982."},{"key":"BF01704913_CR3","doi-asserted-by":"crossref","unstructured":"F. P. Preparata and W. Lipski, Three layers are enough,Proceedings of the 23rd Symposium on Foundations of Computer Science, Chicago, IL, November 3\u20135, 1982, pp. 350\u2013357.","DOI":"10.1109\/SFCS.1982.47"},{"key":"BF01704913_CR4","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","volume":"33","author":"F. P. Preparata","year":"1984","unstructured":"F. P. Preparata and W. Lipski, Optimal three-layer channel routing,IEEE Trans. Comput.,33 (1984), 427\u2013437.","journal-title":"IEEE Trans. Comput."},{"key":"BF01704913_CR5","first-page":"231","volume-title":"Advances in Computing Research: VLSI Theory","author":"W. Lipski","year":"1984","unstructured":"W. Lipski, On the structure of three-layer wirable layouts, inAdvances in Computing Research: VLSI Theory, JAI Press, Greenwich, CT, 1984, pp. 231\u2013243."},{"key":"BF01704913_CR6","first-page":"245","volume-title":"Advances in Computing Research: VLSI Theory","author":"M. L. Brady","year":"1984","unstructured":"M. L. Brady and D. J. Brown, VLSI routing: four layers suffice, inAdvances in Computing Research: VLSI Theory, JAI Press, Greenwich, CT, 1984, pp. 245\u2013257."},{"key":"BF01704913_CR7","volume-title":"The Four-Color Problem","author":"T. L. Saaty","year":"1977","unstructured":"T. L. Saaty and P. C. Kainen,The Four-Color Problem, McGraw-Hill, New York, 1977."},{"key":"BF01704913_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9967-7","volume-title":"Graph Theory","author":"B. Bollob\u00e0s","year":"1979","unstructured":"B. Bollob\u00e0s,Graph Theory, Springer-Verlag, New York, 1979."},{"key":"BF01704913_CR9","first-page":"245","volume":"2","author":"W. Lipski","year":"1979","unstructured":"W. Lipski, E. Lodi, F. Luccio, C. Mugnai and L. Pagli, On two-dimensional data organization, II,Fund. Inform.,2 (1979), 245\u2013260.","journal-title":"Fund. Inform."},{"key":"BF01704913_CR10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","volume":"33","author":"K. Mehlhorn","year":"1985","unstructured":"K. Mehlhorn and F. P. Preparata, Routing through a rectangle,J. Assoc. Comput. Mach.,33 (1985), 60\u201385.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01704913_CR11","volume-title":"Regular Figures","author":"L. Fejes T\u00f3th","year":"1984","unstructured":"L. Fejes T\u00f3th,Regular Figures, Pergamon Press, Oxford, 1984."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01704913.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01704913\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01704913","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T08:31:33Z","timestamp":1557304293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01704913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01704913"],"URL":"https:\/\/doi.org\/10.1007\/bf01704913","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}