{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:46:57Z","timestamp":1759063617933},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1007\/bf00289496","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T03:55:13Z","timestamp":1096948513000},"page":"163-176","source":"Crossref","is-referenced-by-count":34,"title":["Algorithms for routing in planar graphs"],"prefix":"10.1007","volume":"23","author":[{"given":"M.","family":"Becker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02579432","volume":"2","author":"A. Frank","year":"1982","unstructured":"Frank, A.: Disjoint paths in a rectilinear grid. Combinatorica 2, 4 (1982)","journal-title":"Combinatorica"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Frank, A.: Edge Disjoint Paths in Planar Graphs. J. Comb. Theory, Ser. B (To appear)","DOI":"10.1016\/0095-8956(85)90046-2"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/net.3230140204","volume":"14","author":"R. Hassin","year":"1984","unstructured":"Hassin, R.: On Multicommodity Flows in Planar Graphs. Networks, 14, 225?235 (1984)","journal-title":"Networks"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/BFb0015758","volume":"195","author":"M. Kaufmann","year":"1985","unstructured":"Kaufmann, M., Mehlhorn, K.: Generalized Switchbox Routing. ICALP 85, Lect. Notes Comput. Sci. 195, 328?337 (1985)","journal-title":"ICALP 85, Lect. Notes Comput. Sci."},{"key":"CR5","first-page":"1","volume-title":"Advances in Computing research, Vol. 2","author":"Th. Lengauer","year":"1984","unstructured":"Lengauer, Th., Mehlhorn, K.: Four Results on the Complexity of VLSI Computations, in Advances in Computing research, Vol. 2. (F.P. Preparata ed.); pp. 1?22. Greenwich: JAI Press 1984"},{"key":"CR6","unstructured":"Matsumoto, K., Nishizeki, T., Saito, N.: An efficient algorithm for finding multi-commodity flows in planar graphs, SICOMP (To appear)"},{"key":"CR7","volume-title":"EATCS Monographs in Theoretical Computer Science","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Efficient Algorithms Vol.2: Graph Algorithms and NP-completeness, EATCS Monographs in Theoretical Computer Science. Berlin, Heidelberg, New York: Springer 1984"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/4904.4994","volume":"33","author":"K. Mehlhorn","year":"1986","unstructured":"Mehlhorn, K., Preparata, F.P.: Routing through a rectangle. J. Assoc. Comput. Mach. 33, 60?85 (1986)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCAD.1985.1270091","volume":"4","author":"T. Nishezeki","year":"1985","unstructured":"Nishezeki, T., Saito, N., Suzuki, K.: A Linear Time Routing Algorithm for Couvet Grids, IEEE Trans. CAD, 4, 1 (1985)","journal-title":"IEEE Trans. CAD"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1983","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs, J. Comb. Theory, Ser. B 31, 75?81 (1983)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","volume":"5","author":"F.P. Preparata","year":"1984","unstructured":"Preparata, F.P., Lipski, W. Jr.: Optimal three-layer channel routing. IEEE Trans. Comput. C-33, 5, 427?437 (1984)","journal-title":"IEEE Trans. Comput. C-33"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Rivest, R.L., Baratz, A.E., Miller, G.: Provably good channel routing algorithms, Proc. CMU Conf. VLSI Syst. Comput., 151?159 (1981)","DOI":"10.1007\/978-3-642-68402-9_18"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289496.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289496\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T21:14:54Z","timestamp":1554758094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["BF00289496"],"URL":"https:\/\/doi.org\/10.1007\/bf00289496","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}