research
∙
04/04/2023
Dynamic treewidth
We present a data structure that for a dynamic graph G that is updated b...
share
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...
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
∙
08/03/2020
Approximating pathwidth for graphs of small treewidth
We describe a polynomial-time algorithm which, given a graph G with tree...
research
∙
05/31/2020
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles
We present a data structure that in a dynamic graph of treedepth at most...
research
∙
05/05/2020
Many visits TSP revisited
We study the Many Visits TSP problem, where given a number k(v) for each...
research
∙
12/03/2019
Jones' Conjecture in subcubic graphs
We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic ...
research
∙
09/24/2019
Decreasing maximum average degree by deleting independent set or d-degenerate subgraph
The maximum average degree mad(G) of a graph G is the maximum average de...
research
∙
04/30/2019
Improved bounds for the excluded-minor approximation of treedepth
Treedepth, a more restrictive graph width parameter than treewidth and p...
research
∙
11/19/2018
Experimental evaluation of kernelization algorithms to Dominating Set
The theoretical notions of graph classes with bounded expansion and that...
research
∙
02/27/2018
