Antares Chen

According to our database, Antares Chen authored at least 10 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Submodular Hypergraph Partitioning: Metric Relaxations and Fast Algorithms via an Improved Cut-Matching Game.

Antares Chen, Lorenzo Orecchia, Erasmo Tani

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Top-K ranking with a monotone adversary.

Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma

CoRR, 2024

Top-K ranking with a monotone adversary.

Yuepeng Yang, Antares Chen, Lorenzo Orecchia, Cong Ma

Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023

Local algorithms and the failure of log-depth quantum advantage on sparse random CSPs.

Antares Chen, Neng Huang, Kunal Marwaha

CoRR, 2023

Hypergraph Diffusions and Resolvents for Norm-Based Hypergraph Laplacians.

Konstantinos Ameranis, Antares Chen, Adela Frances DePavia, Lorenzo Orecchia, Erasmo Tani

CoRR, 2023

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

2022

Cut Sparsification of the Clique Beyond the Ramanujan Bound: A Separation of Cut Versus Spectral Sparsification.

Antares Chen, Jonathan Shi, Luca Trevisan

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Partial resampling to approximate covering integer programs.

Antares Chen, David G. Harris, Aravind Srinivasan

Random Struct. Algorithms, 2021

2020

Cut Sparsification of the Clique Beyond the Ramanujan Bound.

Antares Chen, Jonathan Shi, Luca Trevisan

CoRR, 2020

2017

Teaching Students to Recognize and Implement Good Coding Style.

Eliane Stampfer Wiese, Michael Yen, Antares Chen, Lucas A. Santos, Armando Fox

Proceedings of the Fourth ACM Conference on Learning @ Scale, 2017