{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T14:21:59Z","timestamp":1774362119442,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_15","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:03Z","timestamp":1770977223000},"page":"217-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Complexity Analysis of the c-Closed Vertex Deletion Problem"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Lehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Komusiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Pascal","family":"Staus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"15_CR1","unstructured":"Behera, B., Husi\u0107, E., Jain, S., Roughgarden, T., Seshadhri, C.: FPT algorithms for finding near-cliques in $$c$$-closed graphs. In: Braverman, M. (ed.) Proceedings of 13th ITCS. LIPIcs, vol. 215, pp. 17:1\u201317:24, Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2018.05.039","volume":"745","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Ke, Y., Otachi, Y., You, J.: Vertex deletion problems on chordal graphs. Theor. Comput. Sci. 745, 75\u201386 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer (2016)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/18M1210459","volume":"49","author":"J Fox","year":"2020","unstructured":"Fox, J., Roughgarden, T., Seshadhri, C., Wei, F., Wein, N.: Finding cliques in social networks: a new distribution-free model. SIAM J. Comput. 49(2), 448\u2013464 (2020)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"2626","DOI":"10.1137\/22M1491721","volume":"37","author":"L Kanesh","year":"2023","unstructured":"Kanesh, L., Madathil, J., Roy, S., Sahu, A., Saurabh, S.: Further exploiting $$c$$-closure for FPT algorithms and kernels for domination problems. SIAM J. Disc. Math. 37(4), 2626\u20132669 (2023)","journal-title":"SIAM J. Disc. Math."},{"key":"15_CR6","unstructured":"Koana, T., Komusiewicz, C., Nichterlein, A., Sommer, F.: Covering many (or few) edges with $$k$$ vertices in sparse graphs. In: Berenbrink, P., Monmege, B. (eds.) Proceedings of 39th STACS. LIPIcs, vol. 219, pp. 42:1\u201342:18, Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1137\/21M1449476","volume":"36","author":"T Koana","year":"2022","unstructured":"Koana, T., Komusiewicz, C., Sommer, F.: Exploiting $$c$$-closure in kernelization algorithms for graph problems. SIAM J. Discret. Math. 36(4), 2798\u20132821 (2022)","journal-title":"SIAM J. Discret. Math."},{"issue":"7","key":"15_CR8","doi-asserted-by":"publisher","first-page":"2156","DOI":"10.1007\/s00453-022-01090-z","volume":"85","author":"T Koana","year":"2023","unstructured":"Koana, T., Komusiewicz, C., Sommer, F.: Computing dense and sparse subgraphs of weakly closed graphs. Algorithmica 85(7), 2156\u20132187 (2023)","journal-title":"Algorithmica"},{"issue":"6","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1007\/s00453-022-01088-7","volume":"85","author":"T Koana","year":"2023","unstructured":"Koana, T., Komusiewicz, C., Sommer, F.: Essentially tight kernels for (weakly) closed graphs. Algorithmica 85(6), 1706\u20131735 (2023)","journal-title":"Algorithmica"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.dam.2021.06.019","volume":"302","author":"T Koana","year":"2021","unstructured":"Koana, T., Nichterlein, A.: Detecting and enumerating small induced subgraphs in $$c$$-closed graphs. Disc. Appl. Math. 302, 198\u2013207 (2021)","journal-title":"Disc. Appl. Math."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186589","volume":"10","author":"C Komusiewicz","year":"2018","unstructured":"Komusiewicz, C.: Tight running time lower bounds for vertex deletion problems. ACM Trans. Comput. Theory 10(2), 1\u201318 (2018)","journal-title":"ACM Trans. Comput. Theory"},{"key":"15_CR12","unstructured":"Komusiewicz, C., Morawietz, N., Sommer, F., Staus, L.P.: The parameter report: an orientation guide for data-driven parameterization (2025)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Lehner, L., Komusiewicz, C., Staus, L.P.: A complexity analysis of the c-closed vertex deletion problem (2025)","DOI":"10.1007\/978-981-95-7127-7_15"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR15","unstructured":"Lokshtanov, D., Surianarayanan, V.: Dominating set in weakly closed graphs is fixed parameter tractable. In: Boja\u0144czyk, M., Chekuri, C. (eds.) Proceedings of 41st FSTTCS, vol. 213, pages 29:1\u201329:17, Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Rusu, I.: Cluster vertex deletion problems on cubic graphs. arXiv preprint arXiv:2505.07443 (2025)","DOI":"10.1016\/j.tcs.2026.115775"},{"issue":"1","key":"15_CR17","first-page":"129","volume":"70","author":"R van Bevern","year":"2014","unstructured":"van Bevern, R.: Towards optimal and expressive kernelization for $$d$$-hitting set. Algorithmica 70(1), 129\u2013147 (2014)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:12:26Z","timestamp":1774325546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}