Dr. Marek Cygan is an assistant professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include fixed parameter tractability, approximation algorithms, and exact exponential algorithms.

Prof. Fedor V. Fomin is a professor of algorithms in the Dept. of Informatics of the University of Bergen, Norway. His research interests are largely in the areas of a
lgorithms
and c
ombinatorics, in particular: parameterized complexity, al
gorithms, and kernelization; exact (exponential time) algorithms; graph algorithms, in particular algorithmic graph minors; graph coloring and different modifications; graph widths parameters (treewidth, branchwidth, clique-width, etc.); and pursuit-evasion and search problems.

Dr. Hab. ¿ukasz Kowalik is an associate professor at the Institute of Informatics of the University of Warsaw, Poland. His research areas include algorithms and graph theory, in particular approximation algorithms, exact algorithms for NP-hard problems, planar graphs, and graph coloring.

Dr. Daniel Lokshtanov is a junior faculty member of the Dept. of Informatics of the University of Bergen, Norway. His research focuses on algorithmic graph theory, and he is the project leader for BeHard, a research project on kernelization.

Dr. Dániel Marx is a senior research fellow at the Institute for Computer Science and Control (SZTAKI) of the Hungarian Academy of Sciences, Budapest, Hungary. His research areas include discrete algorithms, parameterized complexity, and graph theory.

Dr. Marcin Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research focuses on algorithmics, especially fixed parameter tractability and exact computations of NP-hard problems.

Dr. Michä Pilipczuk is a postdoctoral researcher at the Institute of Informatics of the University of Warsaw, Poland. His research areas include parameterized complexity, moderately exponential-time algorithms, and kernelization.

Prof. Saket Saurabh is a member of the Theoretical Computer Science (TCS) group of The Institute of Mathematical Sciences (CIT Campus) in Chennai, India. His research interests include algorithms and graph theory, in particular, parameterized and exact algorithms.

Authors are among the leading researchers in this field

Modern comprehensive explanation of recent tools and techniques

Class-tested content with exercises and suggested reading, suitable for graduate and advanced courses on algorithms

Includes supplementary material: [...]

Introduction.- Kernelization.- Bounded Search Trees.- Iterative Compression.- Randomized Methods in Parameterized Algorithms.- Miscellaneous.- Treewidth.- Finding Cuts and Separators.- Advanced Kernelization Algorithms.- Algebraic Techniques: Sieves, Convolutions, and Polynomials.- Improving Dynamic Programming on Tree Decompositions.- Matroids.- Fixed-Parameter Intractability.- Lower Bounds Based on the Exponential-Time Hypothesis.- Lower Bounds for Kernelization.