The following pages link to (Q4417671):
Displaying 15 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)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
- Moving policies in cyclic assembly line scheduling (Q820155) (← links)
- A parameterized perspective on packing paths of length two (Q849135) (← links)
- Efficiency in exponential time for domination-type problems (Q1003475) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- Sources of complexity in subset choice (Q2483826) (← links)
- Parametrized complexity: New developments and research frontiers (Q2776269) (← links)
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving (Q2908532) (← links)
- Computation Models for Parameterized Complexity (Q4336699) (← links)
- (Q4474097) (← links)
- Algorithms and Data Structures (Q5900780) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
