- Bonamy, M., Bonnet, É., Bousquet, N., Charbit, P., Giannopoulos, P., Kim, E.J. … Thomassé, 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., Löffler, M. and 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.
- Bonnet, É. and Giannopoulos, P. (2019). Orthogonal Terrain Guarding is NP-complete. Journal of Computational Geometry, 10(2), pp. 21–44. doi:10.20382/jocg.v10i2a3.
- Bonnet, É., Giannopoulos, P. 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.
- Alt, H., Cabello, S., Giannopoulos, P. and Knauer, C. (2017). Minimum Cell Connection in Line Segment Arrangements. International Journal of Computational Geometry & Applications, 27(03), pp. 159–176. doi:10.1142/s0218195917500017.
- Cabello, S. and Giannopoulos, P. (2016). The Complexity of Separating Points in the Plane. Algorithmica, 74(2), pp. 643–663. doi:10.1007/s00453-014-9965-6.
- Giannopoulos, P., Knauer, C., Rote, G. and Werner, D. (2013). Fixed-parameter tractability and lower bounds for stabbing problems. Computational Geometry, 46(7), pp. 839–860. doi:10.1016/j.comgeo.2011.06.005.
Dr Panos Giannopoulos
Contact details
Address
Dr Panos Giannopoulos
A401
, College Building [A]
City, University of London
Northampton Square
London EC1V 0HB
United Kingdom
Northampton Square
London EC1V 0HB
United Kingdom
Personal links
About
Overview
Panos is a Lecturer in Algorithms/Computational Geometry at the giCentre. His research interests include geometric optimization, approximation algorithms and fixed-parameter (in)tractability.
Qualifications
- Habilitation, Free University of Berlin, Germany
- PhD, Utrecht University, The Netherlands
- MSc, Imperial College London, United Kingdom
- Fellow, Higher Education Academy, United Kingdom
Postgraduate training
- PGCert in HE, Middlesex University, London, United Kingdom
Employment
- Lecturer, City, University London, 2019 – present
- (Senior) Lecturer, Middlesex University, 2014 – 2019
- Research Fellow, University of Bayreuth, 2011 – 2014
- Research Fellow, Free University of Berlin, 2008 – 2014
Publications
Publications by category
Conference papers and proceedings (4)
- Giannopoulos, P. and Bonnet, É. (2018). Orthogonal Terrain Guarding is NP-complete. 34th International Symposium on Computational Geometry (SoCG 2018) 11-14 June, Budapest.doi:10.4230/LIPIcs.SoCG.2018.11
- Giannopoulos, P., Bonnet, É., Kim, E.J., Rzazewski, P. and Sikora, F. (2018). QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. 34th International Symposium on Computational Geometry (SoCG 2018) 11-14 June, Budapest.doi:10.4230/LIPIcs.SoCG.2018.12
- Giannopoulos, P., Bonnet, É. and Lampis, M. (2017). On the Parameterized Complexity of Red-Blue Points Separation. 12th International Symposium on Parameterized and Exact Computation (IPEC 2017) 4-8 September, Vienna.doi:10.4230/LIPIcs.IPEC.2017.8
- Giannopoulos, P., Abrahamsen, M., Löffler, M. and Rote, G. Geometric Multicut. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019).. doi:10.4230/LIPIcs.ICALP.2019.4
Journal articles (7)
Professional activities
Editorial activity (3)
- Young Researchers Forum, SoCG 2019, Programme Commitee Member, Mar – Jul 2019.
- EWCG 2018, Programme Committee Member, 2018.
- Multimedia Track, SoCG 2012, Programme Committee Member, 2012.