{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:10Z","timestamp":1759637650071},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038971"},{"type":"electronic","value":"9783319038988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03898-8_21","type":"book-chapter","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:57:26Z","timestamp":1384829846000},"page":"243-254","source":"Crossref","is-referenced-by-count":11,"title":["On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Lokshtanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neeldhara","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(83)90012-0","volume":"26","author":"T. Asano","year":"1983","unstructured":"Asano, T., Hirata, T.: Edge-contraction problems. J. Comput. Syst. Sci.\u00a026(2), 197\u2013208 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7-8","key":"21_CR2","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.dam.2011.12.012","volume":"160","author":"R. Belmonte","year":"2012","unstructured":"Belmonte, R., Heggernes, P., van \u2019t Hof, P.: Edge contractions in subclasses of chordal graphs. Discrete Applied Mathematics\u00a0160(7-8), 999\u20131010 (2012)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"21_CR3","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. Inf. Process. Lett.\u00a058(4), 171\u2013176 (1996)","journal-title":"Inf. Process. Lett."},{"key":"21_CR4","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2012.12.041","volume":"476","author":"P.A. Golovach","year":"2013","unstructured":"Golovach, P.A., van \u2019t Hof, P., Paulusma, D.: Obtaining planarity by contracting few edges. Theor. Comput. Sci.\u00a0476, 38\u201346 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Guillemot, S., Marx, D.: A faster fpt algorithm for bipartite contraction. CoRR, abs\/1305.2743 (2013)","DOI":"10.1007\/978-3-319-03898-8_16"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Heggernes, P., van \u2019t Hof, P., L\u00e9v\u00eaque, B., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. In: Parameterized and Exact Computation - 6th International Symposium, IPEC, pp. 55\u201366 (2011)","DOI":"10.1007\/978-3-642-28050-4_5"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.endm.2011.05.016","volume":"37","author":"P. Heggernes","year":"2011","unstructured":"Heggernes, P., van \u2019t Hof, P., L\u00e9v\u00eaque, B., Paul, C.: Contracting chordal graphs and bipartite graphs to paths and trees. Electronic Notes in Discrete Mathematics\u00a037, 87\u201392 (2011)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"21_CR9","unstructured":"Heggernes, P., van \u2019t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. In: Foundations of Software Technology and Theoretical Computer Science, FSTTCS, pp. 217\u2013228 (2011)"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03898-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:53:49Z","timestamp":1558680829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03898-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038971","9783319038988"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03898-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}