Dr Giannopoulos is a senior lecturer in Computer Science at Middlesex and a member of the Foundations of Computing group.
His research interests span the areas of exact and approximation algorithms, parameterized complexity, computational geometry and geometric optimization.
He enjoys studying fundamental algorithmic problems coming from shape matching and computer vision, geometric graphs and networks, sensor networks, and discrete geometry and optimization.
He received his PhD from Utrecht University in the Netherlands, in the field of computational geometry and has held postdoctoral research positions at several universities in Germany, including Free University Berlin and Humboldt University Berlin.
Bonnet, Edouard and Giannopoulos, Panos (2018) Orthogonal terrain guarding is NP-complete. In: 34th International Symposium on Computational Geometry (SoCG 2018), 11-14 Jun 2018, Budapest, Hungary. (Accepted/In press)
Bonnet, Edouard and Giannopoulos, Panos and Kim, Eun Jung and Rzążewski, Paweł and Sikora, Florian (2018) QPTAS and subexponential algorithm for maximum clique on disk graphs. In: 34th International Symposium on Computational Geometry, 11-14 Jun 2018, Budapest, Hungary. (Accepted/In press)
Giannopoulos, Panos and Konzack, Maximilian and Mulzer, Wolfgang (2014) Low-crossing spanning trees: an alternative proof and experiments. In: European Workshop on Computational Geometry, 03-05 Mar 2014, Ein-Gedi, Israel.
Bonnet, Edouard and Giannopoulos, Panos and Lampis, Michael (2017) On the parameterized complexity of red-blue points separation. In: 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), 06-08 Sept 2017, Vienna, Austria.
Alt, Helmut and Cabello, Sergio and Giannopoulos, Panos and Knauer, Christian (2017) Minimum cell connection in line segment arrangements. International Journal of Computational Geometry and Applications, 27 (3). pp. 159-176. ISSN 1793-6357