{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T20:07:14Z","timestamp":1696190834301},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T00:00:00Z","timestamp":1129075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10107-005-0653-9","type":"journal-article","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T11:10:17Z","timestamp":1129115417000},"page":"275-288","source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of the planar directed edge-disjoint paths problem"],"prefix":"10.1007","volume":"105","author":[{"given":"Dirk","family":"M\u00fcller","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,10,12]]},"reference":[{"key":"653_CR1","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5, 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"653_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5, 45\u201368 (1975)","journal-title":"Networks"},{"key":"653_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(93)90153-F","volume":"47","author":"Korach","year":"1993","unstructured":"Korach, E., Penn, M.: A fast algorithm for maximum integral two-commodity flow in planar graphs. Discrete Appl. Math. 47, 77\u201383 (1993)","journal-title":"Discrete Appl. Math."},{"key":"653_CR4","doi-asserted-by":"crossref","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Berlin, 2000","DOI":"10.1007\/978-3-662-21708-5"},{"key":"653_CR5","unstructured":"Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata, F.P. (ed.) VLSI-Theory Advances in Computing Research, Volume 2. JAI Press, Greenwich, Connecticut, 1984"},{"key":"653_CR6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"653_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","volume":"13","author":"Middendorf","year":"1","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of the disjoint paths problem. Combinatorica 13(1), 97\u2013107 (1993)","journal-title":"Combinatorica"},{"key":"653_CR8","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1137\/S0097539792224061","volume":"23","author":"Schrijver","year":"1994","unstructured":"Schrijver, A.: Finding k disjoint paths in a directed planar graph. SIAM J. Comput. 23, 780\u2013788 (1994)","journal-title":"SIAM J. Comput."},{"key":"653_CR9","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin, 2003"},{"key":"653_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/jctb.1993.1062","volume":"59","author":"Seb\u0151","year":"1993","unstructured":"Seb\u0151, A.: Integer plane multiflows with a fixed number of demands. J. Comb. Theory Ser. B 59, 163\u2013171 (1993)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0653-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0653-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0653-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:59Z","timestamp":1559108999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0653-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,12]]},"references-count":10,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["653"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0653-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,12]]}}}