Skip to main content Accessibility help
  • Export citation
  • Recommend to librarian
  • Buy the print book

Book description

Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important results, with accessible explanations of the most recent advances in the area, such as meta-kernelization, representative sets, polynomial lower bounds, and lossy kernelization. The text is divided into four parts, which cover the different theoretical aspects of the area: upper bounds, meta-theorems, lower bounds, and beyond kernelization. The methods are demonstrated through extensive examples using a single data set. Written to be self-contained, the book only requires a basic background in algorithmics and will be of use to professionals, researchers and graduate students in theoretical computer science, optimization, combinatorics, and related fields.


'Kernelization is one of the most important and most practical techniques coming from parameterized complexity. In parameterized complexity, kernelization is the technique of data reduction with a performance guarantee. From humble beginnings in the 1990's it has now blossomed into a deep and broad subject with important applications, and a well-developed theory. Time is right for a monograph on this subject. The authors are some of the leading lights in this area. This is an excellent and well-designed monograph, fully suitable for both graduate students and practitioners to bring them to the state of the art. The authors are to be congratulated for this fine book.'

Rod Downey - Victoria University of Wellington

'Kernelization is an important technique in parameterized complexity theory, supplying in many cases efficient algorithms for preprocessing an input to a problem and transforming it to a smaller one. The book provides a comprehensive treatment of this active area, starting with the basic methods and covering the most recent developments. This is a beautiful manuscript written by four leading researchers in the area.'

Noga Alon - Princeton University, New Jersey and Tel Aviv University

'This book will be of great interest to computer science students and researchers concerned with practical combinatorial optimization, offering the first comprehensive survey of the rapidly developing mathematical theory of pre-processing - a nearly universal algorithmic strategy when dealing with real-world datasets. Concrete open problems in the subject are nicely highlighted.'

Michael Fellows - Universitetet i Bergen, Norway

'The study of kernelization is a relatively recent development in algorithm research. With mathematical rigor and giving the intuition behind the ideas, this book is an excellent and comprehensive introduction to this new field. It covers the entire spectrum of topics, from basic and advanced algorithmic techniques to lower bounds, and goes beyond these with meta-theorems and variations on the notion of kernelization. The book is suitable for students wanting to learn the field as well as experts, who would both benefit from the full coverage of topics.'

Hans L. Bodlaender - Universiteit Utrecht

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Send to Kindle
  • Send to Dropbox
  • Send to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.


Page 1 of 2

Page 1 of 2


Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed