Publications

Conference Proceedings & Journal articles

  • Luca Aceto, Antonis Achilleos, Aggeliki Chalki, and Anna Ingólfsdóttir. The complexity of deciding characteristic formulae in van Glabbeek’s branching-time spectrum. accepted at CSL 2025, link to arxiv

  • Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, and Stathis Zachos. On the power of counting the total number of computation paths of NPTMs. Proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation. link to paper, link to arxiv

  • Antonis Achilleos and Aggeliki Chalki. Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. link to paper, link to arxiv

  • Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Petros Pantavos, Aris Pagourtzis, and Stathis Zachos. Completeness, approximability and exponential time results for counting problems with easy decision version. Theoretical Computer Science 915: 55-73 (2022). link to paper

  • Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, and Stathis Zachos. Guest column: A panorama of counting problems the decision version of which is in P. SIGACT News 53(3): 46-68 (2022). link to paper

  • Aggeliki Chalki, Costas D. Koutras, and Yorgos Zikos. A note on the complexity of S4.2. Journal of Applied Non-Classical Logics 31(2): 108-129 (2021). link to paper

  • Aggeliki Chalki, Eleni Bakali, and Aris Pagourtzis. Characterizations and approximability of hard counting classes below #P. Proceedings of the 16th International Conference on Theory and Applications of Models of Computation, 2020. link to paper, link to arxiv

  • Aggeliki Chalki, Costas D. Koutras, and Yorgos Zikos. A quick guided tour to the modal logic S4.2. Logic Journal of the IGPL 26(4): 429-451 (2018). link to paper

  • Eleni Bakali, Aggeliki Chalki, Petros Pantavos, Aris Pagourtzis, and Stathis Zachos. Completeness results for counting problems with easy decision. Proceedings of the 10th International Conference in Algorithms and Complexity, 2017. link to paper