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 study a variation of the vertex cover problem where it is required that the graph induced
by the vertex cover is connected. We prove that this problem is polynomial in chordal …

Abstract In the Connected Vertex Cover problem we are given an undirected graph G
together with an integer k and we are to find a subset of vertices X of size at most k, such that …

The question if a given partial solution to a problem can be extended reasonably occurs in
many algorithmic approaches for optimization problems. For instance, when enumerating …

We analyze edge dominating set from a parameterized perspective. More specifically, we
prove that this problem is in FPT for general (weighted) graphs. The corresponding …

We perform a systematic study in the computational complexity of the connected variant of
three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle …

We present a new method of solving graph problems related to Vertex Cover by
enumerating and expanding appropriate sets of nodes. As an application, we obtain …

Trust plays an important role in a Web-based social network. Given the open and dynamic
nature of such an online virtual community, trust evaluation relies on transitive relationships …

We consider the variant of the minimum vertex cover problem in which we require that the
cover induces a connected subgraph. We give new approximation results for this problem in …

We continue the study of boundary classes for NP-hard problems and focus on seven NP-
hard graph problems involving non-local properties: Hamiltonian Cycle, Hamiltonian Cycle …