Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs

Jie Gao, Pawel Gawrychowski, Panos Giannopoulos +4

A \emph{disk graph} is the intersection graph of (closed) disks in the plane. We consider the classic problem of finding a maximum clique in a disk graph. For general disk graphs,…