Items where Author is "Bonnet, E."
Bonnet, E. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2019).
Orthogonal Terrain Guarding is NP-complete.
Journal of Computational Geometry, 10(2),
pp. 21-44.
doi: 10.20382/jocg.v10i2a3
Giannopoulos, P. ORCID: 0000-0002-6261-1961, Bonnet, E. & Lampis, M. (2019).
On the Parameterized Complexity of Red-Blue Points Separation.
Journal of Computational Geometry, 10(1),
pp. 181-206.
doi: 10.20382/jocg.v10i1a7
Giannopoulos, P. ORCID: 0000-0002-6261-1961 & Bonnet, E. (2018).
Orthogonal Terrain Guarding is NP-complete.
In:
34th International Symposium on Computational Geometry (SoCG 2018).
34th International Symposium on Computational Geometry (SoCG 2018), 11 - 14 June 2018, Budapest, Hungary.
doi: 10.4230/LIPIcs.SoCG.2018.11
Giannopoulos, P., Bonnet, E., Kim, E. J. , Rzazewski, P. & Sikora, F. (2018). QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. In: 34th International Symposium on Computational Geometry (SoCG 2018). 34th International Symposium on Computational Geometry (SoCG 2018), 11 - 14 July 2018, Budapest, Hungary. doi: 10.4230/LIPIcs.SoCG.2018.12
Giannopoulos, P. ORCID: 0000-0002-6261-1961, Bonnet, E. & Lampis, M. (2017).
On the Parameterized Complexity of Red-Blue Points Separation.
In:
12th International Symposium on Parameterized and Exact Computation (IPEC 2017).
12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 04 - 08 Sep 2017, Vienna, Austria.
doi: 10.4230/LIPIcs.IPEC.2017.8