Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graphtheoretic problems. This has …

Over the last two decades, significant advances have been made in the design and analysis
of fixed-parameter algorithms for a wide variety of graph-theoretic problems. This has …

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 …

Let $ G $ be a graph and $ a, b $ vertices of $ G $. A minimal $ a, b $-separator of $ G $ is
an inclusion-wise minimal vertex set of $ G $ that separates $ a $ and $ b $. We consider the …

Enumeration problems are often encountered as key subroutines in the exact computation of
graph parameters such as chromatic number, treewidth, or treedepth. In the case of …

Research on the similarity of a graph to being a tree—called the treewidth of the graph—has
seen an enormous rise within the last decade, but a practically fast algorithm for this task has …

The treedepth of a graph is a parameter that describes how it is close to a star graph.
Recently, many parameterized algorithms have been developed for solving various …

Treedepth decomposition has several practical applications and can be used to speed up
many parameterized algorithms. There are several works aiming to design a scalable …