A short proof of Mader's I-paths theorem: 319
Journal of Combinatorial Theory Series B
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Journal of Combinatorial Theory Series B
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
Theory of Computing Systems
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomized algorithms for the loop cutset problem
Journal of Artificial Intelligence Research
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact computation of maximum induced forest
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Finding a minimum feedback vertex set in time O(1.7548n)
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
A Problem Kernelization for Graph Packing
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Querying Protein-Protein Interaction Networks
ISBRA '09 Proceedings of the 5th International Symposium on Bioinformatics Research and Applications
On problems without polynomial kernels
Journal of Computer and System Sciences
A Linear Vertex Kernel for Maximum Internal Spanning Tree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Preprocessing of min ones problems: a dichotomy
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Kernelization hardness of connectivity problems in d-degenerate graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A linear kernel for a planar connected dominating set
Theoretical Computer Science
On the small cycle transversal of planar graphs
Theoretical Computer Science
Subset feedback vertex set is fixed-parameter tractable
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
FPT algorithms for connected feedback vertex set
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Discrete Optimization
FPT algorithms for Connected Feedback Vertex Set
Journal of Combinatorial Optimization
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
Parameterized algorithms for even cycle transversal
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We prove that given an undirected graph G on n vertices and an integer k, one can compute in polynomial time in n a graph G' with at most 5k2 + k vertices and an integer k' such that G has a feedback vertex set of size at most k iff G' has a feedback vertex set of size at most k'. This result improves a previous O(k11) kernel of Burrage et al. [6], and a more recent cubic kernel of Bodlaender [3]. This problem was communicated by Fellows in [5].