{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T06:54:02Z","timestamp":1773471242913,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":4276,"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":[[2001,11]]},"DOI":"10.1016\/s0166-218x(01)00223-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:49Z","timestamp":1027591909000},"page":"177-186","source":"Crossref","is-referenced-by-count":62,"title":["The edge-disjoint paths problem is NP-complete for series\u2013parallel graphs"],"prefix":"10.1016","volume":"115","author":[{"given":"Takao","family":"Nishizeki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Vygen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0166-218X(01)00223-2_BIB1","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/174147.169807","article-title":"An algebraic theory of graph reduction","volume":"40","author":"Arnborg","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"10.1016\/S0166-218X(01)00223-2_BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","article-title":"Easy problems for tree-decomposable graphs","volume":"12","author":"Arnborg","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB3","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","article-title":"Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs I","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB5","unstructured":"A. Dessmark, A. Lingas, A. Proskurowski, Faster algorithms for subgraph isomorphism of k-connected partial k-trees. Proceedings of the Fourth European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer, Berlin, 1996, pp. 501\u2013513."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","article-title":"Edge-disjoint paths in planar graphs","volume":"39","author":"Frank","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB7","series-title":"Paths, Flows, and VLSI-Layout","article-title":"Packing paths, circuits and cuts\u2014a survey","author":"Frank","year":"1990"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","article-title":"Primal\u2013dual approximation algorithms for integral flow and multicut in trees","volume":"18","author":"Garg","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(96)00046-1","article-title":"The complexity of subgraph isomorphism for classes of partial k-trees","volume":"164","author":"Gupta","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1006\/jcss.1998.1579","article-title":"Approximations for the disjoint paths problem in high-diameter planar networks","volume":"57","author":"Kleinberg","year":"1998","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0166-218X(01)00223-2_BIB13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/0214023","article-title":"An efficient algorithm for finding multi-commodity flows in planar networks","volume":"14","author":"Matsumoto","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(01)00223-2_BIB14","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","article-title":"On the complexity of disjoint paths problem","volume":"13","author":"Middendorf","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","article-title":"On the complexity of finding iso- and other morphisms for partial k-trees","volume":"108","author":"Matou\u0161ek","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB16","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/dimacs\/020\/06","article-title":"Efficient algorithms for disjoint paths in planar graphs","volume":"20","author":"Ripphausen-Lipa","year":"1995","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0166-218X(01)00223-2_BIB17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0095-8956(90)90063-6","article-title":"Graph minors IX, Disjoint crossed paths","volume":"49","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/S0166-218X(01)00223-2_BIB18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1006\/jctb.1995.1006","article-title":"Graph minors XIII, The disjoint paths problem","volume":"63","author":"Robertson","year":"1995","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB19","unstructured":"P. Scheffler, A practical linear time algorithm for disjoint paths in graphs with bound tree-width, Technical Report 396, Department of Mathematics, Technische Universit\u00e4t Berlin, 1994."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(90)90136-Z","article-title":"Edge-disjoint paths in a grid bounded by two nested rectangles","volume":"27","author":"Suzuki","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB21","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF01553903","article-title":"Algorithms for multicommodity flows in planar graphs","volume":"4","author":"Suzuki","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB22","unstructured":"M. Sys\u0142o, NP-complete problems on some tree-structured graphs: a review, Proceedings of the WG\u201983 International Workshop on Graph Theoretic Concepts in Computer Science, University of Verlag Rudolf Trauner, Linz, West Germany, 1983, pp. 478\u2013489."},{"issue":"3","key":"10.1016\/S0166-218X(01)00223-2_BIB23","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","article-title":"Linear-time computability of combinatorial problems on series\u2013parallel graphs","volume":"29","author":"Takamizawa","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB24","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/S0895480194275825","article-title":"Algorithms for vertex partitioning problems on partial k-trees","volume":"10","author":"Telle","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB25","unstructured":"J. Vygen, Disjoint paths, Report No. 94816, Research Institute for Discrete Mathematics, University of Bonn, 1994."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB26","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0166-218X(93)E0177-Z","article-title":"NP-completeness of some edge-disjoint paths problems","volume":"61","author":"Vygen","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB27","unstructured":"J. Vygen, Edge-disjoint paths in series\u2013parallel graphs, Report No. 98871, Research Institute for Discrete Mathematics, University of Bonn, 1998."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB28","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01294465","article-title":"A linear-time algorithm for edge-disjoint paths in planar graphs","volume":"15","author":"Wagner","year":"1995","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB29","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1006\/jagm.1996.0061","article-title":"Edge-coloring partial k-trees","volume":"21","author":"Zhou","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB30","doi-asserted-by":"crossref","unstructured":"X. Zhou, T. Nishizeki, The edge-disjoint paths problem is NP-complete for partial k-trees, Proceedings of the Ninth International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Springer, Berlin, 1998.","DOI":"10.1007\/3-540-49381-6_44"},{"key":"10.1016\/S0166-218X(01)00223-2_BIB31","unstructured":"X. Zhou, T. Nishizeki, The edge-disjoint paths problem is NP-complete for series\u2013parallel graphs, Technical Report 9801, Department of System Information Sciences, Graduate School of Information Sciences, Tohoku University, 1998."},{"key":"10.1016\/S0166-218X(01)00223-2_BIB32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s004539910002","article-title":"Finding edge-disjoint paths in partial k-trees","volume":"26","author":"Zhou","year":"2000","journal-title":"Algorithmica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002232?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002232?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T07:21:49Z","timestamp":1556868109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":32,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0166218X01002232"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00223-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}