Aggeliki Chalki

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 12

Top Topics

Traveling Salesman

Intrinsic Complexity

Top Venues

Publications

Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingólfsdóttir
The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum. CoRR (2024)
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
On the Power of Counting the Total Number of Computation Paths of NPTMs. TAMC (2024)
Antonis Achilleos, Aggeliki Chalki
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. MFCS (2023)
Antonis Achilleos, Aggeliki Chalki
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. CoRR (2023)
Eleni Bakali, Aggeliki Chalki, Sotiris Kanellopoulos, Aris Pagourtzis, Stathis Zachos
On the power of counting the total number of computation paths of NPTMs. CoRR (2023)
Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Completeness, approximability and exponential time results for counting problems with easy decision version. Theor. Comput. Sci. 915 (2022)
Eleni Bakali, Aggeliki Chalki, Andreas Göbel, Aris Pagourtzis, Stathis Zachos
. SIGACT News 53 (3) (2022)
Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos
A note on the complexity of S4.2. J. Appl. Non Class. Logics 31 (2) (2021)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
Characterizations and approximability of hard counting classes below #P. CoRR (2020)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). TAMC (2020)
Aggeliki Chalki, Costas D. Koutras, Yorgos Zikos
A quick guided tour to the modal logic S4.2. Log. J. IGPL 26 (4) (2018)
Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos
Completeness Results for Counting Problems with Easy Decision. CIAC (2017)