{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:04:17Z","timestamp":1743149057653,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202969"},{"type":"electronic","value":"9783319202976"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20297-6_4","type":"book-chapter","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T01:55:05Z","timestamp":1434938105000},"page":"53-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes"],"prefix":"10.1007","author":[{"given":"Maxim A.","family":"Babenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander V.","family":"Karzanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","volume":"39","author":"A Frank","year":"1985","unstructured":"Frank, A.: Edge-disjoint paths in planar graphs. J. Comb. Theor. Ser. B 39, 164\u2013178 (1985)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(87)80002-1","volume":"18","author":"AV Karzanov","year":"1987","unstructured":"Karzanov, A.V.: Half-integral five-terminus flows. Discrete Appl. Math. 18(3), 263\u2013278 (1987)","journal-title":"Discrete Appl. Math."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1994.1001","volume":"60","author":"AV Karzanov","year":"1994","unstructured":"Karzanov, A.V.: Paths and metrics in a planar graph with three or more holes, Part I: metrics. J. Comb. Theor. Ser. B 60, 1\u201318 (1994)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jctb.1994.1002","volume":"60","author":"AV Karzanov","year":"1994","unstructured":"Karzanov, A.V.: Paths and metrics in a planar graph with three or more holes, Part II: paths. J. Comb. Theor. Ser. B 60, 19\u201335 (1994)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"2\u20133","key":"4_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0166-218X(94)00090-Z","volume":"56","author":"AV Karzanov","year":"1995","unstructured":"Karzanov, A.V.: Half-integral flows in a planar graph with four holes. Discrete Appl. Math. 56(2\u20133), 267\u2013295 (1995)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s004930050040","volume":"18","author":"AV Karzanov","year":"1998","unstructured":"Karzanov, A.V.: A combinatorial algorithm for the minimum (2, r)-metric problem and some generalizations. Combinatorica 18(4), 549\u2013568 (1998)","journal-title":"Combinatorica"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(83)90100-2","volume":"6","author":"H Okamura","year":"1983","unstructured":"Okamura, H.: Multicommodity flows in graphs. Discrete Appl. Math. 6, 55\u201362 (1983)","journal-title":"Discrete Appl. Math."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Comb. Theor. Ser. B 31, 75\u201381 (1981)","journal-title":"J. Comb. Theor. Ser. B"},{"key":"4_CR9","series-title":"Algorithms and Combinatorics","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Algorithms and Combinatorics, vol. 24. Springer, Heidelberg (2003)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01294465","volume":"15","author":"D Wagner","year":"1995","unstructured":"Wagner, D., Weine, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15(1), 135\u2013150 (1995)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Computer Science -- Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20297-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:49:36Z","timestamp":1676944176000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20297-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202969","9783319202976"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20297-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"23 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}