Parameterized complexity of feedback vertex set with connectivity constraints

DOI10.1016/J.JCSS.2026.103816MaRDI QIDQ7307944zbMATH OpenFDO

Authors Ankit Abhinav, Satyabrata Jana, Nidhi Purohit, Abhishek Sahu, Saket Saurabh

Publication date 3 August 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2026.103816

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A 4k^2 kernel for feedback vertex set
• Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
• An improved FPT algorithm for independent feedback vertex set
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Conflict free feedback vertex set: a parameterized dichotomy
• Constant Time Generation of Rooted Trees
• Counting subgraphs via homomorphisms
• Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time
• Divide-and-Color
• Faster fixed parameter tractable algorithms for finding feedback vertex sets
• FPT algorithms for connected feedback vertex set
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XX: Wagner's conjecture
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 512804 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
• Improved analysis of highest-degree branching for feedback vertex set
• Kernelization. Theory of parameterized preprocessing
• Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
• Lower bounds on kernelization
• On group feedback vertex set parameterized by the size of the cutset
• On parameterized independent feedback vertex set
• On problems without polynomial kernels
• Parameterized algorithms
• Parameterized approximation scheme for feedback vertex set
• Parametrized complexity theory.
• Reducibility among combinatorial problems
• Simultaneous feedback vertex set: a parameterized perspective
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• The number of trees

This page was built for publication: Parameterized complexity of feedback vertex set with connectivity constraints

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