Minimum and Maximum Category Constraints in the Orienteering Problem with Time Windows. - Konstantinos Ameranis; Nikolaos Vathis; Dimitris Fotakis 001 (SEA², 2019)

Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. - Lorenzo Orecchia; Konstantinos Ameranis; Charalampos E. Tsourakakis; Kunal Talwar (ICML, 2022)

Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game. - Konstantinos Ameranis; Antares Chen; Lorenzo Orecchia; Erasmo Tani (CoRR, 2023)

Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians. - Konstantinos Ameranis; Antares Chen; Adela Frances DePavia; Lorenzo Orecchia; Erasmo Tani (CoRR, 2023)

Fast Algorithms for Hypergraph PageRank with Applications to Semi-Supervised Learning. - Konstantinos Ameranis; Adela Frances DePavia; Lorenzo Orecchia; Erasmo Tani (ICML, 2024)