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. We also give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three  points.
After 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 \mathcal{D give a simple construction with 13 pairwise intersecting disks that cannot be stabbed by three points.