No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs (To Appear in SOSA 2026)
With Anand Louis
Triangles Improve 0.878 Approximation for Maxcut (APPROX 2025)
With Fredie George, and Anand Louis
With Anand Louis, and Prasad Raghavendra
With Anand Louis, and Arka Ray
With Akash Kumar, and Anand Louis
Independent Sets in Semirandom Hypergraphs (WADS 2021)
With Yash Khanna, and Anand Louis