Before revision: We present an O(n) expected time algorithm and an O(n \log n) deterministic time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane.
After revision: Suppose we are given a set \mathcal{D O(n \log n) deterministic time algorithm to find a set of five points that stab a set of n pairwise intersecting disks in the plane.