Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms

DOI10.1016/j.cosrev.2007.09.001zbMath1296.00019OpenAlexW2061881283MaRDI QIDQ458454

Dimitrios M. Thilikos

Publication date: 7 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2007.09.001

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) External book reviews (00A17)

Cites Work

• Fixed-parameter tractability and completeness II: On completeness for W[1]
• On miniaturized problems in parameterized complexity theory
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
• Fixed-Parameter Tractability and Completeness I: Basic Results
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms