Teaching Students to Recognize and Implement Good Coding Style. - Eliane Stampfer Wiese; Michael Yen; Antares Chen; Lucas A. Santos; Armando Fox (L@S, 2017)

Cut Sparsification of the Clique Beyond the Ramanujan Bound. - Antares Chen; Jonathan Shi; Luca Trevisan 001 (CoRR, 2020)

Partial resampling to approximate covering integer programs. - Antares Chen; David G. Harris 001; Aravind Srinivasan (Random Struct. Algorithms, 2021)

Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification. - Antares Chen; Jonathan Shi; Luca Trevisan 001 (SODA, 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)

Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs. - Antares Chen; Neng Huang; Kunal Marwaha (CoRR, 2023)

Top-K ranking with a monotone adversary. - Yuepeng Yang; Antares Chen; Lorenzo Orecchia; Cong Ma 001 (COLT, 2024)

Top-K ranking with a monotone adversary. - Yuepeng Yang; Antares Chen; Lorenzo Orecchia; Cong Ma (CoRR, 2024)

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