We show that the VC-dimension of a graph can be computed in time n^log
d...
A tournament is an orientation of a complete graph.
We say that a vert...
In the classic TARGET SAT SELECTION problem, we are asked to minimise th...
We unify and extend previous kernelization techniques in sparse classes ...
We present an algorithm to count the number of occurrences of a pattern ...
Inspired by the potential of improving tractability via gap- or
above-gu...
We prove almost tight bounds on the length of paths in 2-edge-connected
...
We consider the problem of computing the size of each r-neighbourhood fo...
A set of vertices W in a graph G is called resolving if for any two
dist...
The notions of bounded expansion and nowhere denseness not only offer ro...
We consider the problems ZERO EXTENSION and METRIC LABELLING under the
p...
A vertex x in a tournament T is called a king if for every vertex y of
T...