Efficient Algorithms for Computing Maximum Cliques in Disk and Ball Graphs with Bounded Radii Diversity

This paper presents efficient algorithms for computing maximum cliques in disk graphs with a bounded number of different radii sizes, and in ball graphs with ball centers on a bounded number of parallel planes or planes perpendicular to a single plane.