@article{e62f195b0a704ec3bb5f63c179ee0caa,
title = "Stabbing pairwise intersecting disks by five points",
abstract = "Suppose we are given a set D of n pairwise intersecting disks in the plane. A planar point set P stabs D if and only if each disk in D contains at least one point from P. We present a deterministic algorithm that takes O(n) time to find five points that stab D. Furthermore, we give a simple example of 13 pairwise intersecting disks that cannot be stabbed by three points. Moreover, we present a simple argument showing that eight disks can be stabbed by at most three points. This provides a simple – albeit slightly weaker – algorithmic version of a classical result by Danzer that such a set D can always be stabbed by four points.",
keywords = "Disk intersection graph, LP-type problem, Stabbing set",
author = "Sariel Har-Peled and Haim Kaplan and Wolfgang Mulzer and Liam Roditty and Paul Seiferth and Micha Sharir and Max Willert",
note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",
year = "2021",
month = jul,
doi = "10.1016/j.disc.2021.112403",
language = "אנגלית",
volume = "344",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier B.V.",
number = "7",
}