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 describe a polynomial-time algorithm which, given a graph G with treewidth t,
approximates the pathwidth of G to within a ratio of. This is the first algorithm to achieve an f …

We present a data structure that in a dynamic graph of treedepth at most d, which is modified
over time by edge insertions and deletions, maintains an optimum-height elimination forest …

The treedepth of a graph $ G $ is the least possible depth of an elimination forest of $ G $: a
rooted forest on the same vertex set where every pair of vertices adjacent in $ G $ is bound …

For many algorithmic problems on graphs of treewidth, a standard dynamic programming
approach gives algorithms with time and space complexity. It turns out that when one …

Abstract The Homomorphism Preservation Theorem (HPT) of classical model theory states
that a first-order sentence is preserved under homomorphisms if, and only if, it is equivalent …

Abstract This year's Parameterized Algorithms and Computational Experiments challenge
(PACE 2020) was devoted to the problem of computing the treedepth of a given graph …

Abstract Bulian and Dawar [Algorithmica, 2016] introduced the notion of elimination distance
in an effort to define new tractable parameterizations for graph problems and showed that …

Treedepth is a minor-monotone graph invariant in the family of “width measures” that
includes treewidth and pathwidth. The characterization and approximation of these …

We investigate the parameterized complexity of Binary CSP parameterized by the vertex
cover number and the treedepth of the constraint graph, as well as by a selection of related …