Generating Faster Algorithms for d-Path Vertex Cover

Cites work

scientific article; zbMATH DE number 1304341 (Why is no real title available?)
scientific article; zbMATH DE number 512804 (Why is no real title available?)
scientific article; zbMATH DE number 1508265 (Why is no real title available?)
A faster FPT algorithm for 3-path vertex cover
A fixed-parameter algorithm for the vertex cover P₃ problem
A measure \& conquer approach for the analysis of exact algorithms
A new approach to proving upper bounds for MAX-2-SAT
A parameterized perspective on packing paths of length two
An FPT algorithm for the vertex cover $P_4$ problem
An $O^\ast ( 2 . 61 9^k )$ algorithm for 4-path vertex cover
An efficient fixed-parameter algorithm for 3-hitting set
An improved fixed-parameter algorithm for vertex cover
Automated generation of search tree algorithms for hard graphs modification problems
Exact algorithms for dominating set
Exact algorithms for edge domination
Exact algorithms for maximum independent set
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
Exact exponential algorithms.
Faster FPT algorithm for 5-path vertex cover
Faster parameterized algorithms for two vertex deletion problems
Improved upper bounds for vertex cover
Iterative compression and exact algorithms
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
Minimum $k$-path vertex cover
Moderately exponential time algorithms for the maximum bounded-degree-1 set problem
Nondeterminism within $P^ * $
Parameterized algorithm for 3-path vertex cover
Parameterized algorithmics for d-HITTING SET
Parameterized algorithms
Parameterized and Exact Computation
Refined memorization for vertex cover
Solving multicut faster than $2^{n }$
The node-deletion problem for hereditary properties is NP-complete
Theory and Applications of Satisfiability Testing
Vertex cover: Further observations and further improvements

Cited in

(4)

On kernels for $d$-path vertex cover
Highly connected Steiner subgraph: parameterized algorithms and applications to hitting set problems
Solving Co-Path/Cycle Packing and Co-Path Packing faster than $3^k$
Solving Co-Path/Cycle Packing and Co-Path Packing faster than $3^k$

This page was built for publication: Generating Faster Algorithms for d-Path Vertex Cover

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