We present a data structure that for a dynamic graph G that is updated b...
The treedepth of a graph G is the least possible depth of an elimination...
In this work, we present the first linear time deterministic algorithm
c...
We describe a polynomial-time algorithm which, given a graph G with
tree...
We present a data structure that in a dynamic graph of treedepth at most...
We study the Many Visits TSP problem, where given a number k(v) for each...
We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic
...
The maximum average degree mad(G) of a graph G is the maximum
average de...
Treedepth, a more restrictive graph width parameter than treewidth and
p...
The theoretical notions of graph classes with bounded expansion and that...
The notions of bounded expansion and nowhere denseness not only offer ro...