{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:06:36Z","timestamp":1768719996465,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":3516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0022-0000(03)00073-4","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:57:28Z","timestamp":1056981448000},"page":"654-685","source":"Crossref","is-referenced-by-count":45,"title":["The Turing way to parameterized complexity"],"prefix":"10.1016","volume":"67","author":[{"given":"Marco","family":"Cesati","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00073-4_BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed parameter tractability and completeness IV","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0022-0000(03)00073-4_BIB2","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender, B. de Fluiter, Intervalizing k-colored graphs, in: Proceedings of the 22th International Colloquium on Automata, Languages, and Programming (ICALP\u201995), Lecture Notes in Computer Science, Vol. 944, Springer, Berlin, 1995, 87\u201398.","DOI":"10.1007\/3-540-60084-1_65"},{"key":"10.1016\/S0022-0000(03)00073-4_BIB3","unstructured":"H.L. Bodlaender, D. Kratsch, Private communication, 1994."},{"issue":"4\/5","key":"10.1016\/S0022-0000(03)00073-4_BIB4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s001530050069","article-title":"The parameterized complexity of short computation and factorization","volume":"36","author":"Cai","year":"1997","journal-title":"Arch. Math. Logic"},{"issue":"3","key":"10.1016\/S0022-0000(03)00073-4_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(01)00207-1","article-title":"Perfect Code is W[1]-complete","volume":"81","author":"Cesati","year":"2002","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00073-4_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/malq.19970430204","article-title":"Computation models for parameterized complexity","volume":"43","author":"Cesati","year":"1997","journal-title":"MLQ Math. Log. Q"},{"key":"10.1016\/S0022-0000(03)00073-4_BIB7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00073-4_BIB8","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00073-4_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(97)00101-1","article-title":"Threshold dominating sets and an improved characterization of W[2]","volume":"209","author":"Downey","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00073-4_BIB10","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/S0022-0000(03)00073-4_BIB11","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows, B. Kapron, M.T. Hallett, H.T. Wareham, Parameterized complexity of some problems in logic and linguistics (Extended Abstract), in: Proceedings of Second Workshop on Structural Complexity and Recursion-theoretic Methods in Logic Programming, Lecture Notes in Computer Science, Vol. 813, Springer, Berlin, 1994, pp. 89\u2013101.","DOI":"10.1007\/3-540-58140-5_10"},{"key":"10.1016\/S0022-0000(03)00073-4_BIB12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","article-title":"The Steiner problem in graphs","volume":"1","author":"Dreyfus","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0022-0000(03)00073-4_BIB13","unstructured":"H.T. Wareham, The parameterized complexity of intersection and composition operations on sets of finite-state automata, in: Proceedings of the Fifth International Conference on Implementation and Application of Automata, Lecture Notes in Computer Science, Vol. 2088, Springer, Berlin, 2000, 302\u2013310."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000734?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000734?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T06:31:16Z","timestamp":1585031476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0022000003000734"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00073-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}