The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …

Preprocessing, or data reduction, is a standard technique for simplifying and speeding up
computation. Written by a team of experts in the field, this book introduces a rapidly …

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 give an algorithm that, given an-vertex graph and an integer, in time either outputs a tree
decomposition of of width at most or determines that the treewidth of is larger than. This is …

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 …

Let M=(E, I) be a matroid and let S={S 1, ċ, S t} be a family of subsets of E of size p. A
subfamily Ŝ⊆ S is q-representative for S if for every set Y⊆ E of size at most q, if there is a …

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 …

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 …

For an even integer t≥ 2, the Matching Connectivity matrix H t is a matrix that has rows and
columns both labeled by all perfect matchings of the complete graph on t vertices; an entry H …

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 …