Items where Author is "Giannopoulos, P."
Giannopoulos, P. 
ORCID: 0000-0002-6261-1961 & Cabello, S. (2024).
Delaunay Triangulation and Convex Polygons with Predictions.
Paper presented at the 40th European Workshop on Computational Geometry, 13-15 Mar 2024, Ioannina, Greece.
Brito-Pacheco, D., Karabağ, C., Brito-Loeza, C. , Giannopoulos, P. ORCID: 0000-0002-6261-1961 & Reyes Aldasoro, C. C. ORCID: 0000-0002-9466-2018 (2024).
Relationship between irregularities of the nuclear envelope and mitochondria in hela cells observed with electron microscopy.
Paper presented at the IEEE International Symposium on Biomedical Imaging, 27-30 May 2024, Athens, Greece.
Brito-Pacheco, D., Karabağ, C., Brito-Loeza, C. , Giannopoulos, P. ORCID: 0000-0002-6261-1961 & Reyes-Aldasoro, C. C. ORCID: 0000-0002-9466-2018 (2023).
Relationship Between Irregularities of the Nuclear Envelope and Mitochondria in HeLa cells Observed with Electron Microscopy.
doi: 10.1101/2023.11.14.567016
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2023).
On k-means for segments and polylines.
In:
31st Annual European Symposium on Algorithms (ESA 2023).
ESA 2023, 4-6 Sep 2023, Amsterdam, the Netherlands.
doi: 10.4230/LIPIcs.ESA.2023.28
Cabello, S. & Giannopoulos, P. ORCID: 0000-0002-6261-1961 (2023).
On $k$-means for segments and polylines.
doi: 10.48550/arXiv.2305.10922
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),
pp. 1-38.
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(3),
pp. 575-607.
doi: 10.1007/s00454-020-00232-w
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
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
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
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
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