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 …

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 …

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 …

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 study the parameterized complexity of various classic vertex-deletion problems such as
Odd cycle transversal, Vertex planarization, and Chordal vertex deletion under hybrid …

We give an algorithmic and lower bound framework that facilitates the construction of
subexponential algorithms and matching conditional complexity bounds. It can be applied to …

We introduce a logic called distance neighborhood logic with acyclicity and connectivity
constraints (A&C DN for short) which extends existential MSO1 with predicates for querying …

A central problem in parameterized algorithms is to obtain algorithms with running time
f(k)⋅n^O(1) such that f is as slow growing a function of the parameter k as possible. In …

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 …