The following pages link to (Q4506265):
Displayed 4 items.
- 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)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)