| Efficient flow-based approximation algorithms for submodular hypergraph partitioning via a generalized cut-matching game K Ameranis, A Chen, L Orecchia, E Tani arXiv e-prints, arXiv: 2301.08920, 2023 | 3 | 2023 |
| Approximation Algorithms for -Shortest Path and -Group Steiner Tree Y Makarychev, M Ovsiankin, E Tani arXiv preprint arXiv:2404.17669, 2024 | | 2024 |
| Learning-Based Algorithms for Graph Searching Problems AF DePavia, E Tani, A Vakilian International Conference on Artificial Intelligence and Statistics, 928-936, 2024 | | 2024 |
| Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians K Ameranis, A Chen, A DePavia, L Orecchia, E Tani arXiv preprint arXiv:2307.11042, 2023 | | 2023 |
| Error-Tolerant Exact Query Learning of Finite Set Partitions with Same-Cluster Oracle AF DePavia, OMM del Campo, E Tani arXiv preprint arXiv:2305.13402, 2023 | | 2023 |
| Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game A Chen, L Orecchia, E Tani arXiv preprint arXiv:2301.08920, 2023 | | 2023 |
ANTARES CHENPhD Student, University of ChicagoVerified email at uchicago.edu
