Pages that link to "Item:Q293227"

The following pages link to An improved fixed-parameter algorithm for vertex cover (Q293227):

Displaying 23 items.

• Confronting intractability via parameters (Q465686) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• Refined memorization for vertex cover (Q835007) (← 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 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)
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms (Q1877711) (← links)
• Improved exact algorithms for MAX-SAT (Q1878397) (← links)
• The complexity of irredundant sets parameterized by size (Q1971218) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• A note on the complexity of minimum dominating set (Q2458924) (← 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)
• Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
• Reachability problems in interval-constrained and cardinality-constrained graphs (Q6132865) (← links)