معرفی
Charis Papadopoulos is a Professor at the Department of Mathematics, University of Ioannina, Greece. He holds a PhD in Computer Science (2005) and MSc (2001) from the University of Ioannina, and conducted postdoctoral research at the University of Bergen, Norway (2005-2007). His academic activities include visiting researcher positions at the University of Ioannina (2008-2010) before joining the faculty in 2011.
- Education: MSc and PhD in Computer Science, University of Ioannina
- Postdoc: Algorithms Research Group, University of Bergen (2005-2007)
His research interests focus on Theoretical Computer Science, particularly:
- Design and analysis of algorithms
- Algorithmic graph theory
- Graph modification problems
- Width parameters and graph layouts
- Combinatorial enumeration
- Algorithm engineering
Recent publications address structural parameterization of cluster deletion, subset feedback vertex set problems, avoidable vertex/path enumeration, and connectivity-preserving subgraphs. His work spans both journal publications (e.g., Algorithmica, Theory of Computing Systems) and conference proceedings (e.g., WALCOM, SODA).
He has served on program committees for major conferences including:
- CIAC 2025
- EuroCG 2025
- WADS 2023
- WALCOM 2023
Current projects include FANTA (Efficient Algorithms for Network Analysis) funded by H.F.R.I. and Separators and Cut Problems under HFRI grants. He has supervised PhD and Master's dissertations and collaborated with European research institutions.
