3 papers
cs.DS2026
Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
Benjamin Bergougnoux, Vera Chekan, Stefan Kratsch
In this work we contribute to the study of the fine-grained complexity of problems parameterized by multi-clique-width, which was initiated by Fürer [ITCS 2017] and pursued further…
cs.DS2025
A Logic-based Algorithmic Meta-Theorem for Treedepth: Single Exponential FPT Time and Polynomial Space
Benjamin Bergougnoux, Vera Chekan, Giannos Stamoulis
For a graph , the parameter treedepth measures the minimum depth among all forests , called elimination forests, such that is a subgraph of the ancestor-descendant closur…
math.CO2024
Half-integral Erdős-Pósa property for non-null - paths
Vera Chekan, Colin Geniet, Meike Hatzel +4
For a group , a -labelled graph is an undirected graph where every orientation of an edge is assigned an element of so that opposite orientations of the same edge are…