{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T16:21:55Z","timestamp":1784046115815,"version":"3.55.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":6682,"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":[[1995,4]]},"DOI":"10.1016\/0304-3975(94)00097-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"109-131","source":"Crossref","is-referenced-by-count":354,"title":["Fixed-parameter tractability and completeness II: On completeness for W[1]"],"prefix":"10.1016","volume":"141","author":[{"given":"Rod G.","family":"Downey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00097-3_BIB1","series-title":"STACS'93","first-page":"374","article-title":"Fixed-parameter intractability II","author":"Abrahamson","year":"1993"},{"key":"10.1016\/0304-3975(94)00097-3_BIB2","doi-asserted-by":"crossref","unstructured":"K.A. Abrahamson, R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE Analogues, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(94)00034-Z"},{"key":"10.1016\/0304-3975(94)00097-3_BIB3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","article-title":"Nondeterminism, within P","volume":"22","author":"Buss","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00097-3_BIB4","article-title":"On disjoint cycles","author":"Bodlaender","year":"1990"},{"key":"10.1016\/0304-3975(94)00097-3_BIB5","series-title":"Combinatorial Pattern Matching Proc. 5th Annual Symposium, CPM'94","first-page":"15","article-title":"The parameterized complexity of sequence alignment and concensus (extended abstract)","volume":"Vol. 807","author":"Bodlaender","year":"1994"},{"key":"10.1016\/0304-3975(94)00097-3_BIB6","unstructured":"L. Cai, J. Chen, R.G. Downey and M.F. Fellows, The parameterized complexity of short computation and factorization, submitted."},{"key":"10.1016\/0304-3975(94)00097-3_BIB7","series-title":"COLT'93, Proc. 6th Annual Conference on Learning Theory","first-page":"51","article-title":"Parameterized learning complexity","author":"Downey","year":"1993"},{"key":"10.1016\/0304-3975(94)00097-3_BIB8","first-page":"161","article-title":"Fixed-parameter tractability and completeness","volume":"87","author":"Downey","year":"1992"},{"key":"10.1016\/0304-3975(94)00097-3_BIB9","series-title":"Proc. 7th Annual Structure in Complexity","first-page":"36","article-title":"Fixed-parameter intractability","author":"Downey","year":"1992"},{"key":"10.1016\/0304-3975(94)00097-3_BIB10","series-title":"Complexity Theory","first-page":"166","article-title":"Fixed-parameter tractability and completeness III: Some structural aspects of the W-hierarchy","author":"Downey","year":"1993"},{"key":"10.1016\/0304-3975(94)00097-3_BIB11","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows, Fixed-parameter tractability and completeness I: Basic results, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539792228228"},{"key":"10.1016\/0304-3975(94)00097-3_BIB12","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.F. Fellows, Parameterized computational feasibility, in: P. Clote and J. Remmel, eds., Feasible Mathematics II (Birkhauser, Boston) to appear.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"10.1016\/0304-3975(94)00097-3_BIB13","unstructured":"R.G. Downey and M.F. Fellows, Parameterized Complexity, monograph, in preparation."},{"key":"10.1016\/0304-3975(94)00097-3_BIB14","unstructured":"R.G. Downey and M.F. Fellows, Fixed-parameter tractability and intractability \u2014 A survey, in preparation."},{"key":"10.1016\/0304-3975(94)00097-3_BIB15","series-title":"Proc. Symp. on Theory of Computing (itSTOC)","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989"},{"key":"10.1016\/0304-3975(94)00097-3_BIB16","series-title":"Proc. Symp. Foundations of Comp. Sci. (itFOCS)","first-page":"520","article-title":"An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations","author":"Fellows","year":"1989"},{"key":"10.1016\/0304-3975(94)00097-3_BIB17","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)00097-3_BIB18","series-title":"Proc. 8th Annual Structure in Complexity Conference","first-page":"12","article-title":"On limited nondeterminism and the complexity of the VC-dimension","author":"Papadimitriou","year":"1993"},{"key":"10.1016\/0304-3975(94)00097-3_BIB19","unstructured":"N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, to appear."},{"key":"10.1016\/0304-3975(94)00097-3_BIB20","unstructured":"N. Robertson and P.D. Seymour, Graph minors XV. Wagner's conjecture, to appear."},{"key":"10.1016\/0304-3975(94)00097-3_BIB21","first-page":"525","article-title":"Graph algorithms","volume":"Volume A","author":"van Leeuwen","year":"1990"},{"key":"10.1016\/0304-3975(94)00097-3_BIB22","series-title":"Logic at St. Petersberg","first-page":"89","article-title":"The parameterized complexity of some problems in logic and linguistics (extended abstract)","volume":"Vol. 813","author":"Downey","year":"1994"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000973?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000973?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:27:46Z","timestamp":1555417666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000973"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["0304397594000973"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00097-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}