Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms

Abstract Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of parameterized complexity for computationally hard problems is proving highly fruitful. The purpose of this article is to stir the reader’s interest in this field by providing a gentle introduction to the rewarding field of fixed-parameter algorithms.

Authors

• Rolf Niedermeier

Keywords

No keywords are indexed for this paper.