The Computational Complexity of Finding Second-Order Stationary Points. - Andreas Kontogiannis; Vasilis Pollatos; Sotiris Kanellopoulos; Panayotis Mertikopoulos; Aris Pagourtzis; Ioannis Panageas (ICML, 2024)

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)

Approximation Schemes for k-Subset Sum Ratio and Multiway Number Partitioning Ratio. - Sotiris Kanellopoulos; Giorgos Mitropoulos; Antonis Antonopoulos; Nikos Leonardos; Aris Pagourtzis; Christos Pergaminelis; Stavros Petsalakis; Kanellos Tsitouras (CoRR, 2025)

Beer Path Problems in Temporal Graphs. - Andrea D'Ascenzo; Giuseppe F. Italiano; Sotiris Kanellopoulos; Anna Mpanti; Aris Pagourtzis; Christos Pergaminelis (CoRR, 2025)

Finite Pinwheel Scheduling: the k-Visits Problem. - Sotiris Kanellopoulos; Christos Pergaminelis; Maria Kokkou; Euripides Markou; Aris Pagourtzis (CoRR, 2025)