{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:36Z","timestamp":1759063476400},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549451"},{"type":"electronic","value":"9783540466000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54945-5_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:18:24Z","timestamp":1330211904000},"page":"72-82","source":"Crossref","is-referenced-by-count":1,"title":["Short wire routing in convex grids"],"prefix":"10.1007","author":[{"given":"Frank","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Wolfers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"10_CR1","first-page":"245","volume-title":"Advances in Computing Research: VLSI Theory","author":"M. L. Brady","year":"1984","unstructured":"M. L. Brady, D. J. Brown: VLSI-Routing: Four Layers Suffice, 245\u2013257, in: F. P. Preparata (Ed.), Advances in Computing Research: VLSI Theory, JAI Press, London, England (1984)"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00289496","volume":"23","author":"M. Becker","year":"1986","unstructured":"M. Becker, K. Mehlhorn: Algorithms for Routing in Planar Graphs, Acta Informatica 23 (1986) 163\u2013176","journal-title":"Acta Informatica"},{"key":"10_CR3","unstructured":"M. Formann, D. Wagner, F. Wagner: Routing through a Dense Channel with Minimum Total Wire Length, Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA'91), (1991) 475\u2013482"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","volume":"2","author":"A. Frank","year":"1982","unstructured":"A. Frank: Disjoint Paths in a Rectilinear Grid, Combinatorica 2 (1982) 361\u2013371","journal-title":"Combinatorica"},{"key":"10_CR5","unstructured":"M. Kaufmann, M. Maley: Parity conditions in homotopic knock-knee routing, to appear in Algorithmica"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/0196-6774(86)90016-7","volume":"7","author":"M. Kaufmann","year":"1986","unstructured":"M. Kaufmann, K. Mehlhorn: Routing through a Generalized Switchbox, Journal of Algorithms 7 (1986) 510\u2013531","journal-title":"Journal of Algorithms"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"R. Kuchem, D. Wagner, F. Wagner: Area-Optimal Three Layer Channel Routing, Proceedings of the 30th IEEE Symposium on the Foundations of Computer Science (FOCS'89) (1989) 506\u2013511","DOI":"10.1109\/SFCS.1989.63526"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0196-6774(87)90017-4","volume":"8","author":"T.-L. Lai","year":"1987","unstructured":"T.-L. Lai, A. Sprague: On the Routability of a Convex Grid, Journal of Algorithms 8 (1987) 372\u2013384","journal-title":"Journal of Algorithms"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TCAD.1985.1270099","volume":"4","author":"T. Nishizeki","year":"1985","unstructured":"T. Nishizeki, N. Saito, K. Suzuki: A Linear-Time Routing Algorithm for Convex Grids, IEEE Transactions on Computer-Aided Design 4 (1985) 68\u201375","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"H. Okamura, P. D. Seymour: Multicommodity-Flows in Planar Graphs, Journal of Combinatorial Theory, Series B 31 (1981) 75\u201381","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","volume":"C-33","author":"F. P. Preparata","year":"1984","unstructured":"F. P. Preparata, W. Lipski, Jr.: Optimal three-layer channel routing, IEEE Transactions on Computers, C-33 (1984) 427\u2013437","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"1133","DOI":"10.1109\/TCS.1987.1086260","volume":"CAS-34","author":"M. Sarrafzadeh","year":"1987","unstructured":"M. Sarrafzadeh: Channel routing with provably short wires, IEEE Transactions on Circuits and Systems, CAS-34 (1987) 1133\u20131135","journal-title":"IEEE Transactions on Circuits and Systems"}],"container-title":["Lecture Notes in Computer Science","ISA'91 Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54945-5_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:36Z","timestamp":1619573196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54945-5_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549451","9783540466000"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54945-5_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}