{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:11:55Z","timestamp":1777540315733,"version":"3.51.4"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4915,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0304-3975(97)00300-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:32:04Z","timestamp":1027582324000},"page":"107-127","source":"Crossref","is-referenced-by-count":21,"title":["On computing graph minor obstruction sets"],"prefix":"10.1016","volume":"233","author":[{"given":"Kevin","family":"Cattell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Dinneen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodney G.","family":"Downey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00300-9_BIB1","doi-asserted-by":"crossref","unstructured":"K.R. Abrahamson, M.R. Fellows, Finite automata, bounded treewidth and well-quasiordering, in: Graph Structure Theory, Contemporary Mathematics, vol. 147, American Mathematical Society, Providence, RI, 1993, pp. 539\u2013564.","DOI":"10.1090\/conm\/147\/01199"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB2","doi-asserted-by":"crossref","unstructured":"S. Arnborg, A. Proskurowski, D. Seese, Monadic second-order logic: tree automata and forbidden minors, Technical Report, University of Oregon, Dept. of Computer and Information Sciences UO-CIS-TR-90\/23, 1990.","DOI":"10.1007\/3-540-54487-9_49"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB3","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","article-title":"Quickly excluding a forest","volume":"52","author":"Bienstock","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB4","doi-asserted-by":"crossref","unstructured":"H.P. Bodlaender, M.R. Fellows, T.J. Warnow, Two strikes against perfect phylogeny, Proc. 19th Internat. Colloq. on Automata, Languages and Programming (ICALP \u201992), Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 273\u2013283.","DOI":"10.1007\/3-540-55719-9_80"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB5","doi-asserted-by":"crossref","unstructured":"K. Cattell, M.J. Dinneen, A characterization of graphs with vertex cover up to five, Proc. ORDAL\u201994, Lecture Notes in Computer Science, vol. 831, Springer, Berlin, 1994, pp. 86\u201399.","DOI":"10.1007\/BFb0019428"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB6","doi-asserted-by":"crossref","unstructured":"K. Cattell, M.J. Dinneen, M.R. Fellows, Obstructions to within a few vertices or edges of acyclic, Proceedings WADS\u201995, Lecture Notes in Computer Science, vol. 955, Springer, Berlin, 1995, pp. 415\u2013427.","DOI":"10.1007\/3-540-60220-8_81"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0020-0190(95)00190-5","article-title":"A simple linear time algorithm for finding path decompositions of small width","volume":"57","author":"Cattell","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00300-9_BIB8","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: recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00300-9_BIB9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1017\/S096012950000092X","article-title":"Equivalent definitions of recognizability for graphs of bounded tree-width","volume":"6","author":"Courcelle","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00300-9_BIB10","doi-asserted-by":"crossref","unstructured":"R. Downey, M. Fellows, Parameterized computational feasibility, in: P. Clote, J. Remmel (Eds.), Proc. 2nd Cornell Workshop on Feasible Mathematics, Birkhauser, Basel, 1985, pp. 219\u2013244.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB11","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, M.T. Hallett, T. Wareham, DNA physical mapping: three ways difficult, Proc. 1st Eur. Symp. on Algorithms (ESA\u201993), Lecture Notes in Computer Science, vol. 726, Springer, Berlin, 1993, pp. 157\u2013168.","DOI":"10.1007\/3-540-57273-2_52"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB12","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1145\/44483.44491","article-title":"Nonconstructive tools for proving polynomial-time decidability","volume":"35","author":"Fellows","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB13","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, M.A. Langston, On search, decision and the efficiency of polynomial-time algorithms, Proc. Symp. on the Theory of Computing (STOC), ACM, New York, 1989, pp. 501\u2013512.","DOI":"10.1145\/73007.73055"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB14","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, M.A. Langston, An analogue of the Myhill\u2013Nerode theorem and its use in computing finite-basis characterizations, Proc. Symp. on the Foundations of Computer Science (FOCS), IEEE Press, New York, 1989, pp. 520\u2013525.","DOI":"10.1109\/SFCS.1989.63528"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB15","doi-asserted-by":"crossref","unstructured":"A. Gupta, R. Impagliazzo, Computing planar intertwines, Proc. 1991 Symp. on the Foundations of Computer Science (FOCS \u201991), IEEE Press, New York, 1991.","DOI":"10.1109\/SFCS.1991.185452"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB16","unstructured":"N.G. Kinnersley, Constructive obstruction set isolation for min cut linear arrangement, Technical Report, 1994, Computer Science Department, Univ. of Iowa, Ames, Iowa."},{"key":"10.1016\/S0304-3975(97)00300-9_BIB17","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0166-218X(94)90021-3","article-title":"Obstruction set isolation for the gate matrix layout problem","volume":"54","author":"Kinnersley","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00300-9_BIB18","doi-asserted-by":"crossref","unstructured":"J. Lagergren, An upper bound on the size of an obstruction, in: Graph Structure Theory, Contemporary Mathematics, vol. 147, American Mathematical Society, Providence, RI, 1993, pp. 601\u2013622.","DOI":"10.1090\/conm\/147\/01202"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB19","doi-asserted-by":"crossref","unstructured":"J. Lagergren, S. Arnborg, Finding minimal forbidden minors using a finite congruence, Proc. 18th Internat. Colloq. on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 533\u2013543.","DOI":"10.1007\/3-540-54233-7_161"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB20","first-page":"1972","volume":"Abh. Math, Sem. Hamburg Univ.","author":"Mader","year":"1937","journal-title":"Hinreichende dedingungen fur die existenz von teilgraphen, die zu einem vollstandigen graphen homomorph sind"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB21","doi-asserted-by":"crossref","unstructured":"C.St.J.A. Nash-Williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59 (1963) 833\u2013835.","DOI":"10.1017\/S0305004100003844"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB22","doi-asserted-by":"crossref","unstructured":"A. Proskurowski, Graph reductions, and techniques for finding minimal forbidden minors, in: Graph Structure Theory, Contemporary Mathematics, vol. 147, American Mathematical Society, Providence, RI, 1993, pp. 591\u2013600.","DOI":"10.1090\/conm\/147\/01201"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I: Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB24","doi-asserted-by":"crossref","unstructured":"N. Robertson, P.D. Seymour, Graphs minors \u2013 a survey, in: I. Anderson (Ed.), Surveys in Combinatorics, Cambridge University Press, 1985, Cambridge, pp. 153\u2013171.","DOI":"10.1017\/CBO9781107325678.009"},{"key":"10.1016\/S0304-3975(97)00300-9_BIB25","unstructured":"N. Robertson, P.D. Seymour, Graph minors XVI: Wagner's conjecture, J. Combin. Theory Ser. B, to appear."},{"key":"10.1016\/S0304-3975(97)00300-9_BIB26","first-page":"1994","volume":"J. Combin. Theory Ser. B","author":"Robertson","year":"1962","journal-title":"Quickly excluding a planar graph"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597003009?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597003009?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T01:42:19Z","timestamp":1578447739000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597003009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0304397597003009"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00300-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}