3 citations · 4 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CG2020
Computing a maximum clique in geometric superclasses of disk graphs
Nicolas Grelier
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…
cs.CG2020
Maximum Clique in Disk-Like Intersection Graphs
Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow
We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Cl…