On the parameterized complexity of connected cluster vertex deletion

DOI10.1007/978-3-032-04700-7_1MaRDI QIDQ6852248zbMATH OpenFDO

Authors Ankit Abhinav, Sriram Bhyravarapu, Arusamy Mohanapriya, Saket Saurabh

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_1

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
• Deterministic parameterized connected vertex cover
• Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
• Fourier meets M\"{o}bius: fast subset convolution
• FPT algorithms for connected feedback vertex set
• Kernelization lower bounds through colors and IDs
• Kernelization. Theory of parameterized preprocessing
• Kernels for (connected) dominating set on graphs with excluded topological minors
• Lossy kernelization
• Parameterized algorithms
• Tight running time lower bounds for vertex deletion problems

This page was built for publication: On the parameterized complexity of connected cluster vertex deletion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852248)