{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:21:59Z","timestamp":1709832119219},"reference-count":16,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":5342,"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":[[1998,12]]},"DOI":"10.1016\/s0304-3975(97)00101-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"123-140","source":"Crossref","is-referenced-by-count":22,"title":["Threshold dominating sets and an improved characterization of W[2]"],"prefix":"10.1016","volume":"209","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00101-1_BIB1","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 analogs","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB2","first-page":"49","article-title":"Parameterized complexity analysis in computational biology","volume":"11","author":"Bodlaender","year":"1995","journal-title":"Comput. Appl. Biosci."},{"key":"10.1016\/S0304-3975(97)00101-1_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(94)00251-D","article-title":"The parameterized complexity of the longest common subsequence problem","volume":"147","author":"Bodlaender","year":"1995","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-6377(95)00031-9","article-title":"On the complexity of k-processor scheduling","volume":"18","author":"Bodlaender","year":"1995","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0304-3975(97)00101-1_BIB5","series-title":"Proc. ACM Symp. on the Theory of Computing (STOC)","first-page":"449","article-title":"Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy","author":"Bodlaender","year":"1994"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB6","doi-asserted-by":"crossref","unstructured":"L. Cai, J. Chen, R.G. Downey, M.R. Fellows, On the parameterized complexity of short computation and factorization, Arch. for Math. Logic., to appear.","DOI":"10.1007\/s001530050069"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB7","doi-asserted-by":"crossref","unstructured":"M. Cesati, H.T. Wareham, Parameterized complexity analysis in robot motion planning, in: Proc. 25th IEEE Internet. Conf. on Systems, Man and Cybernetics.","DOI":"10.1109\/ICSMC.1995.537878"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB8","doi-asserted-by":"crossref","unstructured":"R.G. Downey, P.A. Evans, M.R. Fellows, Parameterized learning complexity, Proceedings of the Sixth ACM Workshop on Computational Learning Theory COLT'93, pp. 51\u201357.","DOI":"10.1145\/168304.168311"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB9","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: basic theory","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00101-1_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB11","series-title":"Proceedings of the Second Cornell Workshop on Feasible Mathematics, Feasible Mathematics II","first-page":"219","article-title":"Parameterized computational feasibility","author":"Downey","year":"1995"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB12","series-title":"Proc. Symp. on Logical Foundations of Computer Science (LFCS)","first-page":"89","article-title":"The parameterized complexity of some problems in logic and linguistics","volume":"vol. 813","author":"Downey","year":"1994"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB13","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M. Fellows, K. Regan, Parameterized circuit complexity and the W hierarchy, Theoret. Comput. Sci. A, to appear.","DOI":"10.1016\/S0304-3975(96)00317-9"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB14","series-title":"Proc. DMTCS 96","article-title":"The complexity of relational database queries and an improved characterization of W[1]","author":"Downey","year":"1996"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB15","series-title":"Proc. 10th Internat. Symp. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC'93)","first-page":"121","article-title":"Fixed-parameter complexity and cryptography","volume":"vol. 673","author":"Fellows","year":"1993"},{"key":"10.1016\/S0304-3975(97)00101-1_BIB16","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001011?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001011?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:02:47Z","timestamp":1555405367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0304397597001011"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00101-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}