Parametrized complexity: New developments and research frontiers

MaRDI QIDQ2776269zbMATH OpenFDO

Authors Michael R. Fellows

Publication date 22 July 2002

zbMATH Keywords

parameterized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 2080999
• Parameterized computation and complexity: a new approach dealing with NP-hardness
• Developments in Language Theory
• Algorithms and Data Structures
• Parameterized complexity: the main ideas and connections to practical computing
• scientific article; zbMATH DE number 1956210
• 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
• scientific article; zbMATH DE number 2080999 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• Developments in Language Theory
• 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)