SIAM Journal on Computing
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Vertex cover: further observations and further improvements
Journal of Algorithms
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Refined memorization for vertex cover
Information Processing Letters
Open problems around exact algorithms
Discrete Applied Mathematics
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Upper bounds for vertex cover further improved
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Implicit branching and parameterized partial cover problems
Journal of Computer and System Sciences
Further improvement on maximum independent set in degree-4 graphs
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Parameterized reductions and algorithms for another vertex cover generalization
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Parameterized complexity of vertex deletion into perfect graph classes
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
Hitting and harvesting pumpkins
ESA'11 Proceedings of the 19th European conference on Algorithms
On computing the minimum 3-path vertex cover and dissociation number of graphs
Theoretical Computer Science
Local search: Is brute-force avoidable?
Journal of Computer and System Sciences
Note: A note on the parameterized complexity of unordered maximum tree orientation
Discrete Applied Mathematics
Twin-Cover: beyond vertex cover in parameterized algorithmics
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Theoretical Computer Science
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Deterministic parameterized connected vertex cover
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
New races in parameterized algorithmics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
European Journal of Combinatorics
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Efficient algorithms for the max k-vertex cover problem
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Parameterized top-K algorithms
Theoretical Computer Science
Split Vertex Deletion meets Vertex Cover: New fixed-parameter and exact exponential-time algorithms
Information Processing Letters
Parameterized complexity of 1-planarity
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
TREEWIDTH and PATHWIDTH parameterized by the vertex cover number
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
Parameterized complexity of vertex deletion into perfect graph classes
Theoretical Computer Science
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Information and Computation
| Hi-index | 5.23 |
This paper presents an O(1.2738^k+kn)-time polynomial-space algorithm for Vertex Cover improving the previous O(1.286^k+kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. Most of the previous algorithms rely on exhaustive case-by-case branching rules, and an underlying conservative worst-case-scenario assumption. The contribution of the paper lies in the simplicity, uniformity, and obliviousness of the algorithm presented. Several new techniques, as well as generalizations of previous techniques, are introduced including: general folding, struction, tuples, and local amortized analysis. The algorithm also improves the O(1.2745^kk^4+kn)-time exponential-space upper bound for the problem by Chandran and Grandoni.