{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:27:29Z","timestamp":1767857249717,"version":"3.49.0"},"reference-count":24,"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,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3552,"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)00074-6","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T23:51:31Z","timestamp":1054079491000},"page":"789-807","source":"Crossref","is-referenced-by-count":85,"title":["On the existence of subexponential parameterized algorithms"],"prefix":"10.1016","volume":"67","author":[{"given":"Liming","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Juedes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00074-6_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)00074-6_BIB2","doi-asserted-by":"crossref","unstructured":"J. Alber, H. Bodlaender, H. Fernau, R. Niedermeier, Fixed parameter algorithms for planar dominating set and related problems, in: Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory (SWAT 2000), Lecture Notes in Computer Science, Vol. 1851, Springer, Berlin, 2000, pp. 97\u2013110.","DOI":"10.1007\/3-540-44985-X_10"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB3","doi-asserted-by":"crossref","unstructured":"J. Alber, H. Fernau, R. Niedermeier, Parameterized complexity: exponential speed-up for planar graph problems, in: Proceedings of the Twenty-Eighth International Colloquium on Automata, Languages and Programming (ICALP 2001), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 261\u2013272.","DOI":"10.1007\/3-540-48224-5_22"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(00)00199-0","article-title":"Faster exact algorithms for hard problems","volume":"229","author":"Alber","year":"2001","journal-title":"Discrete Math."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(97)00213-5","article-title":"An improved fixed parameter algorithm for vertex cover","volume":"65","author":"Balasubramanian","year":"1998","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0022-0000(03)00074-6_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/S0097539792228289","article-title":"The complexity of decision versus search","volume":"23","author":"Bellare","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB7","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","article-title":"Nondeterminism in P","volume":"22","author":"Buss","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB8","unstructured":"S. Buss, 1989. Algorithm attributed to S. Buss by J. Buss and J. Goldsmith [7, p. 563]."},{"issue":"3","key":"10.1016\/S0022-0000(03)00074-6_BIB9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1006\/jcss.1997.1490","article-title":"On fixed-parameter tractability and approximability of NP optimization problems","volume":"54","author":"Cai","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1995.1156","article-title":"On the structure of parameterized problems in NP","volume":"123","author":"Cai","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/S0097539795282432","article-title":"Circuit bottom fan-in and computation power","volume":"27","author":"Cai","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB12","doi-asserted-by":"crossref","unstructured":"L. Cai, D. Juedes, Subexponential-time parameterized algorithms collapse the W-hierarchy, in: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, Springer, Berlin, 2001, pp. 273\u2013284.","DOI":"10.1007\/3-540-48224-5_23"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB13","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jagm.2001.1186","article-title":"Vertex cover","volume":"41","author":"Chen","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB14","series-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB15","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows, Parameterized computational feasibility, in: Proceedings of Feasible Mathematics, Vol. II, Birkhauser, Basel, 1995, pp. 219\u2013244.","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB16","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB17","doi-asserted-by":"crossref","unstructured":"R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability, in: Contemporary Trends in Discrete Mathematics: From DIMACS to DIMATIA to the Future, AMS-DIMACS Proceeding Series, Vol. 49, American Mathematical Society, Providence, RI, 1999, pp. 49\u201399.","DOI":"10.1090\/dimacs\/049\/04"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB18","unstructured":"M. Fellows, Personal Communication, 2001."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB20","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Paturi, F. Zane, Which problems have strongly exponential complexity? in: Proceedings of the 39th Symposium on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1998, pp. 653\u2013664.","DOI":"10.1109\/SFCS.1998.743516"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB21","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packings","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Program."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB22","doi-asserted-by":"crossref","unstructured":"R. Niedermeier, P. Rossmanith, Upper bounds for vertex cover further improved, in: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999, pp. 561\u2013570.","DOI":"10.1007\/3-540-49116-3_53"},{"key":"10.1016\/S0022-0000(03)00074-6_BIB23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","article-title":"A general method to speed up fixed-parameter-tractable algorithms","volume":"73","author":"Niedermeier","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00074-6_BIB24","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Systems Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000746?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000746?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T06:54:05Z","timestamp":1553151245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0022000003000746"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00074-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}