The following pages link to (Q4251072):
Displaying 26 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Solving large FPT problems on coarse-grained parallel machines (Q1877701) (← links)
- On the existence of subexponential parameterized algorithms (Q1877709) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
