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 study the Many Visits TSP problem, where given a number k(v) for each...
The maximum average degree mad(G) of a graph G is the maximum
average de...