{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:09Z","timestamp":1758586209795,"version":"3.44.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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-3-032-04700-7_1","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:28Z","timestamp":1758498328000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Parameterized Complexity of\u00a0Connected Cluster Vertex Deletion"],"prefix":"10.1007","author":[{"given":"Ankit","family":"Abhinav","sequence":"first","affiliation":[]},{"given":"Sriram","family":"Bhyravarapu","sequence":"additional","affiliation":[]},{"given":"A.","family":"Mohanapriya","sequence":"additional","affiliation":[]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"issue":"8","key":"1_CR1","first-page":"1743","volume":"14","author":"S Bergmann","year":"2004","unstructured":"Bergmann, S., et al.: Characterization of the yeast transcriptional network. Genome Res. 14(8), 1743\u20131754 (2004)","journal-title":"Genome Res."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, STOC \u201907, pp. 67\u201374, New York, NY, USA, 2007. Association for Computing Machinery","DOI":"10.1145\/1250790.1250801"},{"key":"1_CR3","unstructured":"Bojikian, N., Kratsch, S.: Tight algorithm for connected odd cycle transversal parameterized by clique-width. CoRR, abs\/2402.08046, 2024. arXiv:2402.08046"},{"issue":"4","key":"1_CR4","first-page":"520","volume":"9","author":"L Cai","year":"1996","unstructured":"Cai, L., et al.: Fixed parameter tractability of graph modification problems for hereditary properties. SIAM J. Discret. Math. 9(4), 520\u2013536 (1996)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Cygan, M.: Deterministic parameterized connected vertex cover. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 95\u2013106. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31155-0_9","DOI":"10.1007\/978-3-642-31155-0_9"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-319-21275-3_15","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Lower bounds for kernelization. In: Parameterized Algorithms, pp. 523\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3_15"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Dom, M., Lokshatanov, D., Saurabh, S.: Kernelization lower bounds through colors and ids. ACM Trans. Algorithms 11(2), 13:1\u201313:20 (2014)","DOI":"10.1145\/2650261"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Kernels for (connected) dominating set on graphs with excluded topological minors. ACM Trans. Algorithms 14(1), 6:1\u20136:31 (2018)","DOI":"10.1145\/3155298"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Theory of Parameterized Preprocessing. Cambridge University Press, Kernelization (2019)","DOI":"10.1017\/9781107415157"},{"issue":"3\u20135","key":"1_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3\u20135), 75\u2013174 (2010)","journal-title":"Phys. Rep."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Komusiewicz, C.: Tight running time lower bounds for vertex deletion problems. ACM Trans. Comput. Theory 10(2), 6:1\u20136:18 (2018)","DOI":"10.1145\/3186589"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s00224-024-10161-3","volume":"68","author":"H-O Le","year":"2024","unstructured":"Le, H.-O., Le, V.B.: Complexity of the (connected) cluster vertex deletion problem on h-free graphs. Theor. Comp. Sys. 68(2), 250\u2013270 (2024)","journal-title":"Theor. Comp. Sys."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Lokshtanov, D., Panolan, F., Ramanujan, M.S., Saurabh, S.: Lossy kernelization. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 224\u2013237, New York, NY, USA, 2017. Association for Computing Machinery","DOI":"10.1145\/3055399.3055456"},{"issue":"3","key":"1_CR14","first-page":"460","volume":"42","author":"H Ma","year":"2009","unstructured":"Ma, H., et al.: A survey of computational methods for protein-protein interaction network analysis. J. Biomed. Inform. 42(3), 460\u2013473 (2009)","journal-title":"J. Biomed. Inform."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10878-011-9394-2","volume":"24","author":"N Misra","year":"2012","unstructured":"Misra, N., Philip, G., Raman, V., Saurabh, S., Sikdar, S.: FPT algorithms for connected feedback vertex set. J. Comb. Optim. 24, 131\u2013146 (2012). https:\/\/doi.org\/10.1007\/s10878-011-9394-2","journal-title":"J. Comb. Optim."},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Nederlof, J.: Fast polynomial-space algorithms using M\u00f6bius inversion: improving on Steiner tree and related problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, Languages and Programming. ICALP 2009. LNCS, vol. 5555, pp. 713\u2013725. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_59","DOI":"10.1007\/978-3-642-02927-1_59"},{"issue":"23","key":"1_CR17","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"1_CR18","first-page":"409","volume":"51","author":"D Tsur","year":"2012","unstructured":"Tsur, D., et al.: Faster parameterized algorithms for cluster vertex deletion. Theory Comput. Syst. 51(3), 409\u2013425 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"1_CR19","first-page":"268","volume":"2","author":"D Zeng","year":"2006","unstructured":"Zeng, D., et al.: A survey on web page clustering. Int. J. Web Grid Serv. 2(3), 268\u2013292 (2006)","journal-title":"Int. J. Web Grid Serv."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:30Z","timestamp":1758498330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}