{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:23:24Z","timestamp":1648754604181},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0166-218x(93)90035-m","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"147-164","source":"Crossref","is-referenced-by-count":4,"title":["General vertex disjoint paths in series-parallel graphs"],"prefix":"10.1016","volume":"41","author":[{"given":"Ephraim","family":"Korach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ady","family":"Tal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90035-M_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 A survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/0166-218X(93)90035-M_BIB2","first-page":"38","article-title":"Problems easy for tree-decomposable graphs","volume":"317","author":"Arnborg","year":"1988"},{"key":"10.1016\/0166-218X(93)90035-M_BIB3","series-title":"Dynamic programming on graphs with bounded tree width","author":"Bodlaender","year":"1987"},{"key":"10.1016\/0166-218X(93)90035-M_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(93)90035-M_BIB5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","article-title":"Topology of series-parallel networks","volume":"10","author":"Duffin","year":"1965","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0166-218X(93)90035-M_BIB6","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90035-M_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0166-218X(93)90035-M_BIB8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1061425.1061430","article-title":"The equivalence of theorem proving and the interconnection problem","volume":"5","author":"Lynch","year":"1975","journal-title":"ACM SIGDA Newslett."},{"key":"10.1016\/0166-218X(93)90035-M_BIB9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0606030","article-title":"Disjoint path \u2014 A survey","volume":"6","author":"Robertson","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(93)90035-M_BIB10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors II. Algorithmic aspects of tree width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90035-M_BIB11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0095-8956(86)90031-6","article-title":"Graph minors VI. Disjoint paths across a disc","volume":"41","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)90035-M_BIB12","article-title":"An outline of a disjoint paths algorithm","author":"Robertson","year":"1988","journal-title":"Draft"},{"key":"10.1016\/0166-218X(93)90035-M_BIB13","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\/0166-218X(93)90035-M_BIB14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","article-title":"A polynomial solution to the undirected two paths problem","volume":"27","author":"Shiloach","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90035-M_BIB15","series-title":"Proceedings of the WG'83","first-page":"342","article-title":"NP-complete problems on some tree-structured graphs: a review","author":"Syslo","year":"1984"},{"key":"10.1016\/0166-218X(93)90035-M_BIB16","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear time computability of combinatorial problems on series-parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90035-M_BIB17","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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390035M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9390035M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:01:01Z","timestamp":1580882461000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9390035M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["0166218X9390035M"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90035-m","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}