Near-linear Size Hypergraph Cut Sparsifiers. - Yu Chen 039; Sanjeev Khanna; Ansh Nagda (FOCS, 2020)

Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. - Yu Chen 039; Sanjeev Khanna; Ansh Nagda (ICALP, 2021)

Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs. - Farzam Ebrahimnejad; Ansh Nagda; Shayan Oveis Gharan (ITCS, 2022)

On Approximability of the Permanent of PSD Matrices. - Farzam Ebrahimnejad; Ansh Nagda; Shayan Oveis Gharan (STOC, 2025)

Improved approximation algorithms for the EPR Hamiltonian. - Nathan Ju; Ansh Nagda (CoRR, 2025)

On optimal distinguishers for Planted Clique. - Ansh Nagda; Prasad Raghavendra (CoRR, 2025)