The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …

We introduce graph motif parameters, a class of graph parameters that depend only on the
frequencies of constant-size induced subgraphs. Classical works by Lovász show that many …

Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs.
Maximal biclique enumeration (MBE) is challenging since the number of the maximal …

Parameterization and approximation are two popular ways of coping with NP-hard
problems. More recently, the two have also been combined to derive many interesting …

We investigate the fine-grained complexity of approximating the classical $ k $-median/$ k $-
means clustering problems in general metric spaces. We show how to improve the …

We study the parameterized complexity of approximating the kDominating Set (DomSet)
problem where an integer k and a graph G on n vertices are given as input, and the goal is …

We consider questions that arise from the intersection between the areas of approximation
algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms. The …

We introduce the notion of delineation. A graph class $\mathcal C $ is said delineated if for
every hereditary closure $\mathcal D $ of a subclass of $\mathcal C $, it holds that $\mathcal …

A new method is proposed for online handwriting recognition of Kanji characters. The
method employs substroke HMM as minimum units to constitute Japanese Kanji characters …

We formulate a new hardness assumption, the Strongish Planted Clique Hypothesis
(SPCH), which postulates that any algorithm for planted clique must run in time $ n^{\Omega …