Book review: Invitation to fixed-parameter algorithms

Authors:
Dimitrios M. Thilikos
Affiliations:
Department of Mathematics, National and Kapodistrian University of Athens, Panepistimioupolis, GR-15784, Athens, Greece
Venue:
Computer Science Review
Year:
2007

Citing 6
Cited 0

Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy

Complexity theory
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results

SIAM Journal on Computing
Parameterized complexity: the main ideas and connections to practical computing

Experimental algorithmics
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity: The Main Ideas and Some Research Frontiers

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is a review of the recent book by Rolf Niedermeier on fixed-parameter algorithms. It contains a critical description of the covered material, a comparison with other books dedicated to the same field and an evaluation of its contribution as a monograph to the theoretical computer science community.