research
∙
02/27/2023
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
We study connectivity problems from a fine-grained parameterized perspec...
share
research
∙
02/07/2023
Tight algorithms for connectivity problems parameterized by clique-width
The complexity of problems involving global constraints is usually much ...
research
∙
12/23/2022
Tight Bounds for Connectivity Problems Parameterized by Cutwidth
In this work we start the investigation of tight complexity bounds for c...
research
∙
07/13/2021
Towards exact structural thresholds for parameterized complexity
Parameterized complexity seeks to use input structure to obtain faster a...
research
∙
01/15/2020
Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space
A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivi...
research
∙
04/25/2019
