{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:40:19Z","timestamp":1707558019398},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":4003,"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":[[2002,8]]},"DOI":"10.1016\/s0166-218x(01)00294-3","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"251-261","source":"Crossref","is-referenced-by-count":11,"title":["Length-bounded disjoint paths in planar graphs"],"prefix":"10.1016","volume":"120","author":[{"given":"H.","family":"van der Holst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.C.","family":"de Pina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00294-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1994"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB2","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem-proving procedures, Proceedings of the Third ACM Symposium on Theory of Computing, New York, Association for Computing Machinery, Shaker Heights, OH, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB4","series-title":"Computer and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","article-title":"The complexity of finding maximum disjoint paths with length constraints","volume":"12","author":"Itai","year":"1982","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0166-218X(90)90024-7","article-title":"The complexity of finding paths with min\u2013max objective function","volume":"26","author":"Li","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00294-3_BIB8","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1145\/322276.322287","article-title":"On the complexity of integer programming","volume":"28","author":"Papadimitriou","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(01)00294-3_BIB9","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","article-title":"Finding two disjoint paths between two pairs of vertices in a graph","volume":"25","author":"Perl","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(01)00294-3_BIB11","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0166-218X(01)00294-3_BIB12","first-page":"317","article-title":"A view of shortest route methods in integer programming","volume":"16","author":"Wolsey","year":"1974","journal-title":"Cahiers Centre d\u2019\u00c9tudes Recherche Op\u00e9rationelle"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002943?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002943?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:24:02Z","timestamp":1554967442000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0166218X01002943"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00294-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}