{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:32:56Z","timestamp":1778715176315,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3978,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00414-5","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T19:19:50Z","timestamp":1034968790000},"page":"997-1008","source":"Crossref","is-referenced-by-count":88,"title":["Parameterized complexity of finding subgraphs with hereditary properties"],"prefix":"10.1016","volume":"289","author":[{"given":"Subhash","family":"Khot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00414-5_BIB1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","article-title":"Fixed parameter tractability of graph modification problem for hereditary properties","volume":"58","author":"Cai","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00414-5_BIB2","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\/S0304-3975(01)00414-5_BIB3","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\/S0304-3975(01)00414-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","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00414-5_BIB5","series-title":"Parameterized Complexity","author":"Downey","year":"1999"},{"key":"10.1016\/S0304-3975(01)00414-5_BIB6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(99)00185-7","article-title":"The complexity of irredundant sets parameterized by size","volume":"100","author":"Downey","year":"2000","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00414-5_BIB7","doi-asserted-by":"crossref","unstructured":"M.R. Fellows, C. McCartin, On the parametric complexity of schedules to minimize tardy tasks, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(02)00811-3"},{"key":"10.1016\/S0304-3975(01)00414-5_BIB8","series-title":"Problem [GT21], Computers and Intractability, A Guide to The Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(01)00414-5_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0304-3975(01)00414-5_BIB10","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"2","key":"10.1016\/S0304-3975(01)00414-5_BIB11","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","article-title":"The Node-Deletion Problem for Hereditary Properties is NP-complete","volume":"20","author":"Lewis","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(01)00414-5_BIB12","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1006\/jagm.1998.0996","article-title":"Parameterizing above Guaranteed Values","volume":"31","author":"Mahajan","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00414-5_BIB13","doi-asserted-by":"crossref","unstructured":"A. Natanzon, R. Shamir, R. Sharan, Complexity Classification of Some Edge Modification Problems, in Proc. 25th Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201999), Ascona, Switzerland, Lecture Notes in Computer Science, Springer, Berlin, 1999.","DOI":"10.1007\/3-540-46784-X_8"},{"issue":"2","key":"10.1016\/S0304-3975(01)00414-5_BIB14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1137\/0210021","article-title":"Edge-deletion problems","volume":"10","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004145?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:23:41Z","timestamp":1578536621000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004145"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00414-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}