{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T06:53:58Z","timestamp":1773471238200,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,10,1]],"date-time":"1985-10-01T00:00:00Z","timestamp":496972800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,17]],"date-time":"2013-08-17T00:00:00Z","timestamp":1376697600000},"content-version":"vor","delay-in-days":10182,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1985,10]]},"DOI":"10.1016\/0095-8956(85)90046-2","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"164-178","source":"Crossref","is-referenced-by-count":72,"title":["Edge-disjoint paths in planar graphs"],"prefix":"10.1016","volume":"39","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 4","key":"10.1016\/0095-8956(85)90046-2_BIB1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","article-title":"Disjoint paths in a rectilinear grid","volume":"2","author":"Frank","year":"1982","journal-title":"Combinatorica"},{"issue":"No. 3","key":"10.1016\/0095-8956(85)90046-2_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(81)90120-4","article-title":"Maximum flow in (s, t) planar networks","volume":"13","author":"Hassin","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0095-8956(85)90046-2_BIB3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0196-6774(82)90032-3","article-title":"The NP-completeness column: An outgoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0095-8956(85)90046-2_BIB4","article-title":"On Dual Integrality, Min-Max Equalities, and Algorithms in Combinatorial Linear Programs","author":"Korach","year":"1982","journal-title":"Ph.D. thesis"},{"key":"10.1016\/0095-8956(85)90046-2_BIB5","series-title":"Routing through a rectangle, report","author":"Mehlhorn","year":"1983"},{"key":"10.1016\/0095-8956(85)90046-2_BIB6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","article-title":"Multicommodity flows in planar graphs","volume":"31","author":"Okamura","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(85)90046-2_BIB7","series-title":"Mathematical Programming The State of the Art","article-title":"Min-max results in combinatorial optimization","author":"Schrijver","year":"1983"},{"key":"10.1016\/0095-8956(85)90046-2_BIB8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(85)90046-2_BIB9","first-page":"178","article-title":"On odd cuts and plane multicommodity flows","volume":"42","author":"Seymour","year":"1981"},{"key":"10.1016\/0095-8956(85)90046-2_BIB10","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","article-title":"2-linked graphs","volume":"1","author":"Thomassen","year":"1980","journal-title":"European J. Combin."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895685900462?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895685900462?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:56:12Z","timestamp":1548777372000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895685900462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,10]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,10]]}},"alternative-id":["0095895685900462"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(85)90046-2","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1985,10]]}}}