We show that the VC-dimension of a graph can be computed in time n^log
d...
We introduce torsoids, a canonical structure in matching covered graphs,...
In the classic TARGET SAT SELECTION problem, we are asked to minimise th...
Given two disjoint sets W_1 and W_2 of points in the plane, the Optimal
...
The celebrated Erdős-Pósa theorem states that every undirected graph
tha...