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 …

Parameterized computation theory has developed rapidly over the last two decades. In
theoretical computer science, it has attracted considerable attention for its theoretical value …

Given a graph G=(V, E) G=(V,E) and a subset of its vertices V′⊆ VV^′⊆V, the subgraph
induced by V′ V^′ in G is that with vertex set V′ V^′ and edge set E′ E^′ formed by …

We present a new parameterized algorithm for the feedback vertex set problem (fvs) on
undirected graphs. We approach the problem by considering a variation of it, the disjoint …

In the Feedback Vertex Set (FVS) problem, one is given an undirected graph G and an
integer k, and one needs to determine whether there exists a set of k vertices that intersects …

We give a new general approach for designing exact exponential-time algorithms for subset
problems. In a subset problem the input implicitly describes a family of sets over a universe …

As graphs continue to grow in size, we seek ways to effectively process such data at scale.
The model of streaming graph processing, in which a compact summary is maintained as …

Recent empirical evaluations of exact algorithms for Feedback Vertex Set have
demonstrated the efficiency of a highest-degree branching algorithm with a degree-based …

In this work, we study the d-Hitting Set and Feedback Vertex Set problems through the
paradigm of finding diverse collections of r solutions of size at most k each, which has …

In this paper, we propose an algorithm that, given an undirected graph $ G $ of $ m $ edges
and an integer $ k $, computes a graph $ G'$ and an integer $ k'$ in $ O (k^ 4 m) $ time such …