{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:13Z","timestamp":1725664813738},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:46Z","timestamp":1330295926000},"page":"271-285","source":"Crossref","is-referenced-by-count":0,"title":["Wiring edge-disjoint layouts"],"prefix":"10.1007","author":[{"given":"Ruth","family":"Kuchem","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"22_CR1","unstructured":"M. Brady and D. Brown: VLSI routing: Four layers suffice. In F. Preparata, editor, Advances in Computer Research, VOL 2: VLSI Theory, JAI Press Inc. (1984) 245\u2013257"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/12.46293","volume":"C-39","author":"M. Brady","year":"1990","unstructured":"M. Brady and M. Sarrafzadeh: Stretching a knock-knee layout for multilayer wiring. IEEE Transactions on Computers, C-39 (1990) 148\u2013152","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G. Battista Di","year":"1994","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis: Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry 4 (1994) 235\u2013282","journal-title":"Computational Geometry"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"T. F. Gonzales and S. Zheng: Simple three-layer channel routing algorithms. In J. H. Reif, editor, Proceedings Aegean Workshop on Computing. Springer-Verlag, Lecture Notes in Computer Science, vol. 319 (1988) 237\u2013246","DOI":"10.1007\/BFb0040391"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0167-9260(91)90029-K","volume":"12","author":"M. Kaufmann","year":"1991","unstructured":"M. Kaufmann and P. Molitor: Minimal stretching of a layout to ensure 2-layer wirability. INTEGRATION The VLSI Journal, 12 (1991) 339\u2013352","journal-title":"INTEGRATION The VLSI Journal"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s004539900028","volume":"15","author":"R. Kuchem","year":"1996","unstructured":"R. Kuchem, D. Wagner, and F. Wagner: Optimizing area for three-layer channel routing. Algorithmica, 15 (1996) 495\u2013519","journal-title":"Algorithmica"},{"key":"22_CR7","unstructured":"W. Lipski, Jr: On the structure of three-layer wirable layouts. In F. Preparata, editor, Advances in Computer Research, VOL 2: VLSI Theory, JAI Press Inc. (1984) 231\u2013243"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01704913","volume":"19","author":"W. Lipski Jr","year":"1987","unstructured":"W. Lipski, Jr and F. P. Preparata: A unified approach to layout wirability. Math. Systems Theory, 19 (1987) 189\u2013203","journal-title":"Math. Systems Theory"},{"key":"22_CR9","unstructured":"R. H. M\u00f6hring, D. Wagner, and F. Wagner: VLSI Network Design: A survey. In M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, Handbooks in Operations Research\/Management Science, Volume on Networks, North-Holland, (1995) 625\u2013712"},{"key":"22_CR10","first-page":"3","volume":"27","author":"P. Molitor","year":"1991","unstructured":"P. Molitor: A survey on wiring. J. Inform. Process. Cybernet. EIK, 27 (1991) 3\u201319","journal-title":"J. Inform. Process. Cybernet. EIK"},{"key":"22_CR11","first-page":"295","volume-title":"DIMACS, Center for Discr. Math. and Comp. Sc., 20","author":"H. Ripphausen-Lipa","year":"1995","unstructured":"H. Ripphausen-Lipa, D. Wagner, and K. Weihe: Efficient algorithms for disjoint paths in planar graphs. In W. Cook, L. Lov\u00e1sz, and P. Seymour, editors, DIMACS, Center for Discr. Math. and Comp. Sc., 20, Springer-Verlag, Berlin (1995) 295\u2013354"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1109\/12.280805","volume":"43","author":"M. Sarrafzadeh","year":"1994","unstructured":"M. Sarrafzadeh, D. Wagner, F. Wagner, and K. Weihe: Wiring knock-knee layouts: a global approach. IEEE Transactions on Computers 43 (1994) 581\u2013589","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR13","first-page":"161","volume":"37","author":"I. G. Tollis","year":"1990","unstructured":"I. G. Tollis: Wiring Layouts in the Tri-Hexagonal Grid. Intern. J. Computer Math. 37 (1990) 161\u2013171","journal-title":"J. Computer Math."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1109\/43.97618","volume":"10","author":"I. G. Tollis","year":"1991","unstructured":"I. G. Tollis: A New Approach to Wiring Layouts. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10 (1991) 1392\u20131400","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-9260(91)90035-J","volume":"12","author":"I. G. Tollis","year":"1991","unstructured":"I. G. Tollis: Wiring in uniform grids and two-colorable maps. INTEGRATION The VLSI Journal 12 (1991) 189\u2013210","journal-title":"INTEGRATION The VLSI Journal"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1142\/S0218195993000178","volume":"3","author":"D. Wagner","year":"1993","unstructured":"D. Wagner: Optimal routing through dense channels. Int. J. on Comp. Geom. and Appl. 3 (1993) 269\u2013289","journal-title":"Int. J. on Comp. Geom. and Appl."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:38:20Z","timestamp":1619573900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}