Surfing with Rod

DOI10.1007/978-3-319-50062-1_2zbMath1359.01039OpenAlexW2558363744MaRDI QIDQ2973715

Michael R. Fellows

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_2

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03)

Cites Work

• Advice classes of parametrized tractability
• Nonconstructive advances in polynomial-time complexity
• Parameterized circuit complexity and the \(W\) hierarchy
• Threshold dominating sets and an improved characterization of \(W[2\)]
• Beyond NP-completeness for problems of bounded width (extended abstract)
• The Birth and Early Years of Parameterized Complexity
• On Problems without Polynomial Kernels (Extended Abstract)
• Nonconstructive tools for proving polynomial-time decidability
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item