{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:23:21Z","timestamp":1725758601212},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452772"},{"type":"electronic","value":"9783642452789"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_45","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T10:35:18Z","timestamp":1385375718000},"page":"468-472","source":"Crossref","is-referenced-by-count":0,"title":["An FPT Certifying Algorithm for the Vertex-Deletion Problem"],"prefix":"10.1007","author":[{"given":"Haiko","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Wilson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"45_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(96)00050-6","volume":"58","author":"L. Cai","year":"1996","unstructured":"Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters\u00a058(4), 171\u2013176 (1996)","journal-title":"Information Processing Letters"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/11533719_82","volume-title":"Computing and Combinatorics","author":"M.-S. Chang","year":"2005","unstructured":"Chang, M.-S., Kloks, T., Kratsch, D., Liu, J., Peng, S.-L.: On the recognition of probe graphs of some self-complementary classes of perfect graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 808\u2013817. Springer, Heidelberg (2005)"},{"key":"45_CR3","first-page":"181","volume":"6","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl\u00a06, 181\u2013203 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"issue":"2","key":"45_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0095-8956(82)90065-X","volume":"33","author":"A. Gy\u00e1rf\u00e1s","year":"1982","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J., Tuza, Z.: Upper bound on the order of \u03c4-critical hypergraphs. Journal of Combinatorial Theory, Series B\u00a033(2), 161\u2013165 (1982)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"45_CR5","first-page":"87","volume":"14","author":"P. Heggernes","year":"2007","unstructured":"Heggernes, P., Kratsch, D.: Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nordic Journal of Computing\u00a014(1), 87\u2013108 (2007)","journal-title":"Nordic Journal of Computing"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Computer Science Review\u00a05(2) (2011)","DOI":"10.1016\/j.cosrev.2010.09.009"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T14:36:01Z","timestamp":1558708561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}