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)
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
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
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
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
Parameterized Complexity
Kernel bounds for disjoint cycles and disjoint paths
Theoretical Computer Science
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Feedback vertex set in mixed graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Enumerating minimal subset feedback vertex sets
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Polynomial kernels for proper interval completion and related problems
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Kernelization of packing problems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Weak compositions and their applications to polynomial lower bounds for kernelization
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A polynomial kernel for feedback arc set on bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Kernelization hardness of connectivity problems in d-degenerate graphs
Discrete Applied Mathematics
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
A linear vertex kernel for maximum internal spanning tree
Journal of Computer and System Sciences
An improved kernel for the undirected planar feedback vertex set problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
On group feedback vertex set parameterized by the size of the cutset
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Note: Towards optimal kernel for connected vertex cover in planar graphs
Discrete Applied Mathematics
Polynomial kernels for Proper Interval Completion and related problems
Information and Computation
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical 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 4k2 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., and a more recent cubic kernel of Bodlaender. This problem was communicated by Fellows.