Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes

Could not fetch data.

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
FPT algorithms for path-transversal and cycle-transversal problems
Parameterized graph separation problems
Simple and improved parameterized algorithms for multiterminal cuts
Almost 2-SAT is fixed-parameter tractable
Secluded connectivity problems
The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Clustering with local restrictions
Finding connected secluded subgraphs
On the computational complexity of length- and neighborhood-constrained path problems
An improved parameterized algorithm for the minimum node multiway cut problem
Parameterized complexity of secluded connectivity problems
Half-integrality, LP-branching, and FPT algorithms
On Multiway Cut Parameterized above Lower Bounds
Finding small separators in linear time via treewidth reduction
Important Separators and Parameterized Algorithms
Designing FPT Algorithms for Cut Problems Using Randomized Contractions
Maximal Flow Through a Network
A fixed-parameter algorithm for the directed feedback vertex set problem
Multicut Is FPT
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
Minimum Bisection Is Fixed-Parameter Tractable
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
Reducing CMSO model checking to highly connected graphs
Randomized Contractions Meet Lean Decompositions
Representative Sets and Irrelevant Vertices
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
Parameterized Algorithms
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem
Directed flow-augmentation
Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes
Deletion to scattered graph classes. I: Case of finite number of graph classes
Finding \(k\)-secluded trees faster

This page was built for publication: Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes

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