We show that the VC-dimension of a graph can be computed in time n^log
d...
We study the following Two-Sets Cut-Uncut problem on planar graphs. Ther...
In the classic TARGET SAT SELECTION problem, we are asked to minimise th...
The survey provides an overview of the developing area of parameterized
...
share