Sergio Cabello: Geometric clustering with the dimension as a parameter.

We will discuss the algorithmic problem of deciding whether a given set of points in d dimensions can be covered with 2 unit balls (or 3 unit, axis-aligned cubes). The problem will be disussed from the point of view of fixed parameter tractability with the dimension d as the paramenter.