The following pages link to (Q4474097):
Displaying 14 items.
- Fundamentals of parameterized complexity (Q383833) (← links)
- Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms (Q458454) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs (Q1764807) (← links)
- A fixed-parameter algorithm for minimum quartet inconsistency (Q1877704) (← links)
- Graph separators: A parameterized view (Q1877710) (← links)
- Computing the similarity of two sequences with nested arc annotations (Q1884953) (← links)
- Sources of complexity in subset choice (Q2483826) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Parametrized complexity: New developments and research frontiers (Q2776269) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- Algorithms and Data Structures (Q5900780) (← links)
