A packing of translates of a convex body in Euclidean d-space is said
to be totally separable if any two packing elements can be separated by a
hyperplane disjoint from the interior of every packing element. The talk is
centered around the problem of finding the largest number of touching
pairs in a totally separable packing of N translates of a given convex body.