Towards a polynomial kernel for directed feedback vertex set
From MaRDI portal
Publication:2663705
DOI10.1007/s00453-020-00777-5OpenAlexW2775670884MaRDI QIDQ2663705
Eduard Eiben, M. S. Ramanujan, Robert Ganian, Sebastian Ordyniak, Benjamin Bergougnoux
Publication date: 19 April 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00777-5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Kernelization using structural parameters on sparse graph classes
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Fundamentals of parameterized complexity
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Disjoint cycles intersecting a set of vertices
- Improved algorithms for feedback vertex set problems
- A cubic kernel for feedback vertex set and loop cutset
- Packing directed circuits
- Approximating minimum feedback sets and multicuts in directed graphs
- Packing directed circuits fractionally
- Packing circuits in eulerian digraphs
- Faster deterministic \textsc{Feedback Vertex Set}
- Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
- Packing cycles through prescribed vertices
- Wannabe bounded treewidth graphs admit a polynomial kernel for DFVS
- On the hardness of losing width
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- (Meta) Kernelization
- A fixed-parameter algorithm for the directed feedback vertex set problem
- On Feedback Vertex Set New Measure and New Structures
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
- Reducibility among Combinatorial Problems
- On Independent Circuits Contained in a Graph
- Inapproximability of H-Transversal/Packing
- Half-integrality, LP-branching and FPT Algorithms
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Parameterized Algorithms
- Packing directed cycles through a specified vertex set
This page was built for publication: Towards a polynomial kernel for directed feedback vertex set
