{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T21:50:34Z","timestamp":1785016234216,"version":"3.55.0"},"reference-count":33,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"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":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0168-0072(95)00020-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T12:11:55Z","timestamp":1049717515000},"page":"119-138","source":"Crossref","is-referenced-by-count":72,"title":["Advice classes of parameterized tractability"],"prefix":"10.1016","volume":"84","author":[{"given":"Liming","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rodney G.","family":"Downey","sequence":"additional","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\/S0168-0072(95)00020-8_BIB1","series-title":"Proc. 10th Symp. on Theoretical Aspects of Computer Science","first-page":"374","article-title":"Fixed-parameter intractability II","author":"Abrahamson","year":"1993"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed-parameter tractability and completeness IV: On Completeness for W[P] and PSPACE analogues","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB3","first-page":"539","article-title":"Finite automata, bounded treewidth, and well-quasiordering","volume":"Vol. 147","author":"Abrahamson","year":"1993"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","article-title":"On the complexity of covering vertices by faces in a planar graph","volume":"17","author":"Bienstock","year":"1988","journal-title":"SIAM J. Comp."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB5","series-title":"Proc. 1st Workshop on Algorithms and Data Structures","first-page":"577","article-title":"Linear time Minor Tests and Depth First Search","volume":"Vol. 382","author":"Bodlaender","year":"1989"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB6","article-title":"On disjoint cycles","author":"Bodlaender","year":"1990"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB7","series-title":"Proc. 19th Internat. Colloquium on Automata, Languages and Programming (ICALP'92)","first-page":"273","article-title":"Two strikes against perfect phylogeny","volume":"Vol. 623","author":"Bodlaender","year":"1992"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB8","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. Comp."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB9_1","series-title":"Proc. Mathematical Foundations of Computer Science","article-title":"On the amount of nondeterminism and the power of verifying","author":"Cai","year":"1993"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB9_2","first-page":"311","article-title":"MFCS'93","volume":"Vol. 711","author":"Cai","year":"1993"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB10","unstructured":"L. Cai, J. Chen, R. Downey and M. Fellows, The complexity of short computation and factorization, Archive for Mathematical Logic, to appear."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB11","article-title":"Graph rewriting: an algebraic and logical approach","volume":"Vol. 1","author":"Courcelle","year":"1990"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB12","first-page":"161","article-title":"Fixed parameter tractability and completeness","volume":"87","author":"Downey","year":"1992"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB13","series-title":"Proc. Structure in Complexity Theory, Seventh Annual Conf.","first-page":"36","article-title":"Fixed parameter intractability (extended abstract)","author":"Downey","year":"1992"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB14","series-title":"Complexity Theory: Current Research","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\/S0168-0072(95)00020-8_BIB15","series-title":"Feasible Mathematics II","first-page":"219","article-title":"Parameterized computational feasibility","author":"Downey","year":"1995"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB16","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed parameter tractability and completeness I: basic results","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed parameter tractability and completeness II: on completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB18","unstructured":"R.G. Downey and M.R. Fellows, Parameterized complexity, monograph in preparation."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB19","series-title":"Proc. First European Symp. on Algorithms","first-page":"157","article-title":"DNA physical mapping: three ways difficult","volume":"vol 726","author":"Fellows","year":"1993"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB20","series-title":"Proc. Tenth Internat. Conf. on Algebraic Algorithms and Error-Correcting Codes (AAECC 10)","article-title":"Fixed-parameter complexity and cryptography","author":"Fellows","year":"1993"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB21","series-title":"Proc. Symp. on Theory of Computing (STOC)","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB22","series-title":"Proc. Symp. Foundations of Comp. Sci. (FOCS)","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\/S0168-0072(95)00020-8_BIB23","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB24","first-page":"68","article-title":"A catalogue of complexity classes","volume":"Vol. 1","author":"Johnson","year":"1990"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB25","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1145\/322017.322031","article-title":"Word problems solvable in logspace","volume":"24","author":"Lipton","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB26","first-page":"415","article-title":"On the complexity of the subgraph problem","volume":"26","author":"Nesetril","year":"1985","journal-title":"Comm. Math. Univ. Carol."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB27","series-title":"Proc. 4th Structure in Complexity Theory Conf.","first-page":"87","article-title":"Finitary substructure languages, with application to the theory of NP-completeness","author":"Regan","year":"1989"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB28","doi-asserted-by":"crossref","unstructured":"N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, J. Comb. Theory B. to appear.","DOI":"10.1006\/jctb.1995.1006"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB29","unstructured":"N. Robertson and P.D. Seymour, Graph minors XV. Wagner's Conjecture, J. Comp. Theory B. to appear."},{"key":"10.1016\/S0168-0072(95)00020-8_BIB30","volume":"Vol. 1","author":"van Leeuwen","year":"1990"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB31","first-page":"527","article-title":"Graph algorithms","volume":"Vol. 1","author":"van Leeuwen","year":"1990"},{"key":"10.1016\/S0168-0072(95)00020-8_BIB32","series-title":"Proc. 8th Structure in Complexity Theory Annual Conference","first-page":"12","article-title":"On limited nonterminism and the complexity of the V-C dimension","author":"Papadimitriou","year":"1993"}],"updated-by":[{"DOI":"10.1016\/j.apal.2018.02.001","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000}}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007295000208?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0168007295000208?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:29:21Z","timestamp":1555561761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0168007295000208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0168007295000208"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(95)00020-8","relation":{"erratum":[{"id-type":"doi","id":"10.1016\/j.apal.2018.02.001","asserted-by":"object"}]},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}