معرفی
Loukas Georgiadis is a Professor at the Department of Computer Science & Engineering, University of Ioannina, Greece. He has held previous academic positions including Assistant Professor at the University of Western Macedonia (2008-2011) and visiting roles at LUISS, Italy (2023-2024) and Università di Roma Tor Vergata (2016). His research focuses on design and analysis of algorithms, graph algorithms, combinatorial optimization, and computational geometry.
Education includes a B.Sc. from the University of Patras (1999), M.A. and Ph.D. in Computer Science from Princeton University (2002, 2005). Professional experience includes roles at HP Laboratories (2007-2008) and the University of Aarhus (2005-2006).
His recent work emphasizes faster algorithms for graph connectivity, fault-tolerant systems, and experimental algorithm analysis. He co-organized the 14th International Conference on Algorithms and Complexity (CIAC 2025) in Rome. Research trends include advancing linear-time algorithms for graph decomposition and exploring dynamic graph properties like dominators and low-high orders.
Grants and advising details are not explicitly stated, but his visiting professorships and conference organizing roles highlight active collaborations. His research lab focuses on theoretical and applied aspects of algorithm design, with contributions to both foundational theory and practical implementations.
