Completeness Results for Counting Problems with Easy Decision. - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis; Petros Pantavos; Stathis Zachos (CIAC, 2017)

A quick guided tour to the modal logic S4.2. - Aggeliki Chalki; Costas D. Koutras; Yorgos Zikos (Log. J. IGPL, 2018)

Characterizations and Approximability of Hard Counting Classes Below ( # mathsf {P} ). - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis (TAMC, 2020)

Characterizations and approximability of hard counting classes below #P. - Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis (CoRR, 2020)

A note on the complexity of S4.2. - Aggeliki Chalki; Costas D. Koutras; Yorgos Zikos (J. Appl. Non Class. Logics, 2021)

Guest column: A panorama of counting problems the decision version of which is in P3. - Eleni Bakali; Aggeliki Chalki; Andreas Göbel 001; Aris Pagourtzis; Stathis Zachos (SIGACT News, 2022)

Completeness, approximability and exponential time results for counting problems with easy decision version. - Antonis Antonopoulos; Eleni Bakali; Aggeliki Chalki; Aris Pagourtzis; Petros Pantavos; Stathis Zachos (Theor. Comput. Sci., 2022)

On structural and descriptive complexity of hard counting problems the decision version of which is easy - Aggeliki Chalki (2022)

Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. - Antonis Achilleos; Aggeliki Chalki (MFCS, 2023)

On the Power of Counting the Total Number of Computation Paths of NPTMs. - Eleni Bakali; Aggeliki Chalki; Sotiris Kanellopoulos; Aris Pagourtzis; Stathis Zachos (TAMC, 2024)

The Complexity of Deciding Characteristic Formulae in Van Glabbeek's Branching-Time Spectrum. - Luca Aceto; Antonis Achilleos; Aggeliki Chalki; Anna Ingólfsdóttir (CSL, 2025)

The complexity of deciding characteristic formulae modulo nested simulation. - Luca Aceto; Antonis Achilleos; Aggeliki Chalki; Anna Ingólfsdóttir (CoRR, 2025)