14 citations · 54 across the 8 of their papers we have counts for
3 papers · 1 filter
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim +2
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Cliq…
On the Parameterized Complexity of Red-Blue Points Separation
Édouard Bonnet, Panos Giannopoulos, Michael Lampis
We study the following geometric separation problem: Given a set of red points and a set of blue points in the plane, find a minimum-size set of lines that separate fro…
Orthogonal Terrain Guarding is NP-complete
Édouard Bonnet, Panos Giannopoulos
A terrain is an x-monotone polygonal curve, i.e., successive vertices have increasing x-coordinates. Terrain Guarding can be seen as a special case of the famous art gallery proble…