Items where City Author is "Giannopoulos, Panos"

Group by: Type | No Grouping

Jump to: Article | Conference or Workshop Item

Number of items: 10.

Article

Bonamy, M., Bonnet, É., Bousquet, N. , Charbit, P., Giannopoulos, P. ORCID: 0000-0002-6261-1961, Kim, E. J., Rzazewski, P., Sikora, F. & Thomasse, S. (2021). EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. Journal of the ACM, 68(2), 9. doi: 10.1145/3433160

Abrahamsen, M., Giannopoulos, P. ORCID: 0000-0002-6261-1961, Loffler, M. & Rote, G. (2020). Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane. Discrete & Computational Geometry, 64, pp. 575-607. doi: 10.1007/s00454-020-00232-w

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

Alt, H., Cabello, S., Giannopoulos, P. ORCID: 0000-0002-6261-1961 & Knauer, C. (2018). Minimum Cell Connection in Line Segment Arrangements. International Journal of Computational Geometry & Applications, 27(03), pp. 159-176. doi: 10.1142/s0218195917500017

Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2016). The Complexity of Separating Points in the Plane. Algorithmica, 74(2), pp. 643-663. doi: 10.1007/s00453-014-9965-6

Conference or Workshop Item

Giannopoulos, P. ORCID: 0000-0002-6261-1961, Abrahamsen, M., Löffler, M. & Rote, G. (2020). Geometric Multicut. Paper presented at the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 8 - 12 July 2019, Patras, Greece. doi: 10.4230/LIPIcs.ICALP.2019.4

Giannopoulos, P. ORCID: 0000-0002-6261-1961 & 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. 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. Paper presented at the 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. Paper presented at the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 04 - 08 Sep 2017, Vienna, Austria. doi: 10.4230/LIPIcs.IPEC.2017.8

This list was generated on Mon Mar 20 02:45:15 2023 UTC.