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)

Error-Tolerant Exact Query Learning of Finite Set Partitions with Same-Cluster Oracle. - Adela Frances DePavia; Olga Medrano Martín del Campo; 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)

Learning-Based Algorithms for Graph Searching Problems. - Adela Frances DePavia; Erasmo Tani; Ali Vakilian (AISTATS, 2024)

Approximation Algorithms for 𝓁p-Shortest Path and 𝓁p-Group Steiner Tree. - Yury Makarychev; Max Ovsiankin; Erasmo Tani (ICALP, 2024)

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

Optimal Algorithms for Learning Partitions with Faulty Oracles. - Adela Frances DePavia; Olga Medrano Martín del Campo; Erasmo Tani (NeurIPS, 2024)

Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game. - Antares Chen; Lorenzo Orecchia; Erasmo Tani (ICALP, 2025)

Non-adaptive Learning of Random Hypergraphs with Queries. - Bethany Austhof; Lev Reyzin; Erasmo Tani (CoRR, 2025)