{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:46:23Z","timestamp":1759146383726},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf01840443","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T17:29:13Z","timestamp":1121275753000},"page":"213-221","source":"Crossref","is-referenced-by-count":53,"title":["Channel routing in knock-knee mode: Simplified algorithms and proofs"],"prefix":"10.1007","volume":"1","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Sarrafzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840443_CR1","unstructured":"M. Becker and K. Mehlhorn.Routing in planar networks. Technical Report, FB 10, Universit\u00e4t des Saarlandes, Sept. 1984."},{"issue":"4","key":"BF01840443_CR2","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, 4 (1982), 361\u2013371.","journal-title":"Combinatorica"},{"key":"BF01840443_CR3","first-page":"328","volume-title":"Generalized switchbox routing","author":"M. Kaufmann","year":"1985","unstructured":"M. Kaufmann and K. Mehlhorn.Generalized switchbox routing. Proc. ICALP 1985, Nafplion, Greece. Springer-Verlag, New York, 1985, pp. 328\u2013337."},{"issue":"1","key":"BF01840443_CR4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","volume":"33","author":"K. Mehlhorn","year":"1986","unstructured":"K. Mehlhorn and F. P. Preparata.Routing through a rectangle. J. ACM,33, 1 (1986), 60\u201385.","journal-title":"J. ACM"},{"key":"BF01840443_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"B31","author":"H. Okamura","year":"1981","unstructured":"H. Okamura and P. D. Seymour.Multicommodity flows in planar graphs. J. Combin. Theory,B31 (1981), 75\u201381.","journal-title":"J. Combin. Theory"},{"key":"BF01840443_CR6","doi-asserted-by":"crossref","unstructured":"R. L. Rivest, A. E. Baratz, and G. Miller.Provably good channel routing algorithms, Proceedings CMU Conference on VLSI Systems and Computations, Oct. 1981, pp. 151\u2013159.","DOI":"10.1007\/978-3-642-68402-9_18"},{"issue":"5","key":"BF01840443_CR7","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 and W. Lipski, Jr.,Optimal three-layer channel routing. IEEE Trans. Comput.,C-33, 5 (1984), 427\u2013437.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840443_CR8","first-page":"189","volume-title":"Channel routing of nets of bounded degree","author":"F. P. Preparata","year":"1984","unstructured":"F. P. Preparata and M. Sarrafzadeh.Channel routing of nets of bounded degree, Proc. VLSI: Algorithms and Architectures. Amain, Italy, North-Holland, Amsterdam, 1984, pp. 189\u2013203."},{"key":"BF01840443_CR9","first-page":"255","volume":"25","author":"M. Sarrafzadeh","year":"1985","unstructured":"M. Sarrafzadeh and F. P. Preparata.Compact channel routing of multiterminal nets. Ann. Discrete Math.,25 (1985), 255\u2013280.","journal-title":"Ann. Discrete Math."},{"key":"BF01840443_CR10","doi-asserted-by":"crossref","unstructured":"S. D. Gao.An algorithm for two-layer channel routing. Proc. of STACS 1985, LNCS Vol. 182, pp. 151\u2013160.","DOI":"10.1007\/BFb0024004"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840443.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840443\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:35:31Z","timestamp":1557416131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":10,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840443"],"URL":"https:\/\/doi.org\/10.1007\/bf01840443","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}