research
∙
05/05/2022
Computing treedepth in polynomial space and linear fpt time
The treedepth of a graph G is the least possible depth of an elimination...
share
research
∙
05/04/2021
Determining 4-edge-connected components in linear time
In this work, we present the first linear time deterministic algorithm c...
research
∙
05/05/2020
Many visits TSP revisited
We study the Many Visits TSP problem, where given a number k(v) for each...
research
∙
09/24/2019
