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

DOI10.1016/J.COSREV.2007.09.001zbMATH Open1296.00019OpenAlexW2061881283MaRDI QIDQ458454FDOQ458454

Authors: 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

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

Cites Work

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

Cited In (2)

• Book review of: J.-L. Chabert et al., Histoire d'algorithmes. Du caillou à la puce
• Book review of: Olle Häggström, Finite Markov chains and algorithmic applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458454)