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 consider several well-studied problems in dynamic algorithms and prove that sufficient
progress on any of them would imply a breakthrough on one of five major open problems in …

We give an algorithm that for an input n-vertex graph G and integer k>0, in time 2^O(k)n,
either outputs that the treewidth of G is larger than k, or gives a tree decomposition of G of …

It is well known that many local graph problems, like Vertex Cover and Dominating Set, can
be solved in time 2 O (tw)| V| O (1) for graphs G=(V, E) with a given tree decomposition of …

Algorithmic research strives to develop fast algorithms for fundamental problems. Despite its
many successes, however, many problems still do not have very efficient algorithms. For …

In this work, we use algebraic methods for studying distance computation and subgraph
detection tasks in the congested clique model. Specifically, we adapt parallel matrix …

Abstract The Local Alignment problem is a classical problem with applications in biology.
Given two input strings and a scoring function on pairs of letters, one is asked to find the …

Due to the lack of unconditional polynomial lower bounds, it is now in fashion to prove
conditional lower bounds in order to advance our understanding of the class P. The vast …

We present a new deterministic algorithm for the Feedback Vertex Set problem
parameterized by the solution size. Our algorithm runs in O⁎((2+ ϕ) k) time, where ϕ< 1.619 …

We obtain a number of lower bounds on the running time of algorithms solving problems on
graphs of bounded treewidth. We prove the results under the Strong Exponential Time …