The following pages link to (Q4940885):
Displaying 11 items.
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Intractability and approximation of optimization theories of cognition (Q2438604) (← links)
- Sources of complexity in subset choice (Q2483826) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
