The following pages link to (Q4506265):
Displayed 12 items.
- Confronting intractability via parameters (Q465686) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- Improved exact algorithms for MAX-SAT (Q1878397) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)