City Research Online

Items where Author is "Bonnet, E."

Up a level
Export as [feed] RSS 2.0 [feed] RSS
Group by: Type | No Grouping
Number of items: 5.

Article

Bonnet, E. and 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. and 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

Conference or Workshop Item

Giannopoulos, P. ORCID: 0000-0002-6261-1961 and Bonnet, E. (2018). Orthogonal Terrain Guarding is NP-complete. Paper presented at the 34th International Symposium on Computational Geometry (SoCG 2018), 11 - 14 June 2018, Budapest, Hungary.

Giannopoulos, P., Bonnet, E., Kim, E. J., Rzazewski, P. and Sikora, F. (2018). QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. Paper presented at the 34th International Symposium on Computational Geometry (SoCG 2018), 11 - 14 July 2018, Budapest, Hungary.

Giannopoulos, P. ORCID: 0000-0002-6261-1961, Bonnet, E. and Lampis, M. (2017). On the Parameterized Complexity of Red-Blue Points Separation. Paper presented at the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 04 - 08 Sep 2017, Vienna, Austria.

This list was generated on Sat Jun 6 05:08:57 2020 UTC.