{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:55Z","timestamp":1761611215682},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_14","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"137-147","source":"Crossref","is-referenced-by-count":11,"title":["Parameterized Complexity of Finding Subgraphs with Hereditary Properties"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"L. Cai, Fixed Parameter Tractability of Graph Modification Problem for Hereditary Properties, Information Processing Letters, 58 (1996), 171\u2013176.","journal-title":"Information Processing Letters"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539792228228","volume":"24","author":"R.G. Downey","year":"1995","unstructured":"R.G. Downey, M.R. Fellows, Fixed Parameter Tractability and Completeness I: Basic theory, SIAM Journal on Computing 24 (1995) 873\u2013921.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"R.G. Downey, M.R. Fellows, Fixed Parameter Tractability and Completeness II: Completeness for W[1], Theoretical Computer Science 141 (1995) 109\u2013131.","journal-title":"Theoretical Computer Science"},{"key":"14_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer Verlag New York, 1999."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(99)00185-7","volume":"100","author":"R.G. Downey","year":"2000","unstructured":"R.G. Downey, M.R. Fellows, V. Raman, The Complexity of Irredundant sets Parameterized by Size, Discrete Applied Mathematics 100 (2000) 155\u2013167.","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR6","volume-title":"Computers and Intractability, A Guide to The Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Problem [GT21], Computers and Intractability, A Guide to The Theory of NP-Completeness, Freeman and Company, New York, 1979."},{"key":"14_CR7","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New york, 1980."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Harary, Graph Theory, Addison-Wesley Publishing Company, 1969.","DOI":"10.21236\/AD0705364"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"J. M. Lewis","year":"1980","unstructured":"J. M. Lewis and M. Yannakakis, The Node-Deletion Problem for Hereditary Properties is NP-complete, Journal of Computer and System Sciences 20(2) (1980) 219\u2013230.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M. Mahajan","year":"1999","unstructured":"M. Mahajan and V. Raman, Parameterizing above Guaranteed Values: MaxSat and MaxCut, Journal of Algorithms 31 (1999) 335\u2013354.","journal-title":"Journal of Algorithms"},{"key":"14_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 25th Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201999)","author":"A. Natanzon","year":"1999","unstructured":"A. Natanzon, R. Shamir and R. Sharan, Complexity Classification of Some Edge Modification Problems, in Proceedings of the 25th Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201999), Ascona, Switzerland (1999); Springer Verlag Lecture Notes in Computer Science."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T04:16:59Z","timestamp":1557029819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}