{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:45:58Z","timestamp":1768693558110,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0020-0190(97)00213-5","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"163-168","source":"Crossref","is-referenced-by-count":92,"title":["An improved fixed-parameter algorithm for vertex cover"],"prefix":"10.1016","volume":"65","author":[{"given":"R.","family":"Balasubramanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00213-5_BIB1","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\/S0020-0190(97)00213-5_BIB2","series-title":"Proc. 2nd Israel Symp. on Theory and Computing Systems","first-page":"118","article-title":"Fixed parameter tractability and approximability of NP-hard optimization problems","author":"Cai","year":"1993"},{"key":"10.1016\/S0020-0190(97)00213-5_BIB3","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\/S0020-0190(97)00213-5_BIB4","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."},{"key":"10.1016\/S0020-0190(97)00213-5_BIB5","series-title":"Feasible Mathematics II","first-page":"219","article-title":"Parametrized Computational feasibility","author":"Downey","year":"1995"},{"key":"10.1016\/S0020-0190(97)00213-5_BIB6","series-title":"Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/S0020-0190(97)00213-5_BIB7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcss.1996.0058","article-title":"On limited non-determinism and the complexity of the V-C dimension","volume":"53","author":"Papadimitriou","year":"1996","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002135?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002135?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:53:43Z","timestamp":1555944823000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019097002135"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00213-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}