  In the 90's Clark, Colbourn and Johnson wrote a seminal paper where they
proved that maximum clique can be solved in polynomial time in unit disk
graphs. Since then, the complexity of maximum clique in intersection graphs of
d-dimensional (unit) balls has been investigated. For ball graphs, the problem
is NP-hard, as shown by Bonamy et al. (FOCS '18). They also gave an efficient
polynomial time approximation scheme (EPTAS) for disk graphs. However, the
complexity of maximum clique in this setting remains unknown. In this paper, we
show the existence of a polynomial time algorithm for a geometric superclass of
unit disk graphs. Moreover, we give partial results toward obtaining an EPTAS
for intersection graphs of convex pseudo-disks.
