Parametrized complexity: New developments and research frontiers
From MaRDI portal
Recommendations
- Parameterized complexity: the main ideas and some research frontiers
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- Some new directions and questions in parameterized complexity
- Algorithms and Data Structures
- Parameterized complexity: the main ideas and connections to practical computing
- Parameterized complexity: The main ideas and connections to practical computing
- scientific article; zbMATH DE number 1341905
- What's next? Future directions in parameterized complexity
- Fundamentals of parameterized complexity
- Parameterized complexity classes beyond para-NP
Cited in
(8)- Simplifying triangulations
- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
- Parameterized complexity: the main ideas and some research frontiers
- Parameterized complexity after (almost) ten years: Review and open questions
- Some new directions and questions in parameterized complexity
- Algorithms and Data Structures
- What Is Known About Vertex Cover Kernelization?
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard
This page was built for publication: Parametrized complexity: New developments and research frontiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776269)
