About me

I am finishing my PhD at the Computation and Reasoning Laboratory in National Technical University of Athens under the supervision of Prof. Aristeidis Pagourtzis and Prof. Stathis Zachos. Prior to that, I had completed the Graduate Program in Logic, Algorithms and Computation, after taking a diploma from the School of Applied Mathematics and Physics of NTUA. My research interests lie in the areas of Structural and Descriptive Complexity of counting problems and Complexity of Modal logics. A short bio of mine can be found here.

Publications

• Completeness, approximability and exponential time results for counting problems with easy decision version, Theoretical Computer Science 2022
  joint work with Antonis Antonopoulos, Eleni Bakali, Petros Pantavos, Aris Pagourtzis, and Stathis Zachos. link to paper

• Guest column: A panorama ofcounting problems the decision version of which is in P, SIGACT News 2022
  joint work with Eleni Bakali, Andreas Göebel, Aris Pagourtzis, and Stathis Zachos. link to paper

• A note on the complexity of S4.2, Journal of Applied Non-Classical Logics 2021
  joint work with Costas D. Koutras, and Yorgos Zikos. link to paper

• Characterizations and Approximability of Hard Counting Classes Below #P, The 16th Annual Conference on Theory and Applications of Models of Computation (TAMC 2020)
  joint work with Eleni Bakali, and Aris Pagourtzis. lnk to paper, link to arxiv

• A quick guided tour to the modal logic S4.2, Logic Journal of the IGPL 2018
  joint work with Costas D. Koutras, and Yorgos Zikos. link to paper

• Completeness Results for Counting Problems with Easy Decision, 10th International Conference on Algorithms and Complexity (CIAC 2017)
  joint work with Eleni Bakali, Petros Pantavos, Aris Pagourtzis, and Stathis Zachos. link to paper

Working Papers

• Counting problems with easy decision: (non)approximability, inclusions, and relations to decision classes,
  joint work with Eleni Bakali, Aris Pagourtzis, and Stathis Zachos.

• A logical characterization of self-reducible counting problems with easy decision version,
  joint work with Antonis Achlleos.

• Logical characterizations of hard counting classes below #P,
  joint work with Eleni Bakali, and Aris Pagourtzis.

Teaching Experience

• 2021 - 2022: Teaching Assistant in Counting Complexity.
• 2014 - 2021: Teaching Assistant in Computational Complexity.
• 2018 - 2021: Teaching Assistant in Advanced Topics in Logic.
• 2016 - 2021: Teaching Assistant in Foundations of Computer Science.
• 2017 - 2018: Teaching Assistant in Algorithms and Complexity.
• 2014 - 2017: Teaching Assistant in Introduction to Programming.

Prior Education

• 2012 - 2015: Graduate Program in Logic, Algorithms and Computation, National and Kapodistrian University of Athens
• 2005 - 2012: School of Applied Mathematics and Physics, National Technical University of Athens