Book review of: Rolf Niedermeier, Invitation to fixed-parameter algorithms
From MaRDI portal
(Redirected from Publication:458454)
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
- scientific article; zbMATH DE number 1341905 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1956210 (Why is no real title available?)
- scientific article; zbMATH DE number 2080999 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- scientific article; zbMATH DE number 1407500 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithms and Data Structures
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- On miniaturized problems in parameterized complexity theory
Cited in
(2)
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)
