Publications

• No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs (To Appear in SOSA 2026)

Jointly with Anand Louis

• Triangles Improve 0.878 Approximation for Maxcut (APPROX 2025)

Jointly with Fredie George,  and Anand Louis

• Robust Algorithms for Recovering Planted r-Colorable Graphs (COLT 2025)

Jointly with Anand Louis, and Prasad Raghavendra

• Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes (SWAT 2024)

Jointly with Anand Louis, and Arka Ray

• Exact Recovery Algorithm for Planted Bipartite Graph in Semirandom Graphs (ICALP 2022)

Jointly with Akash Kumar,  and Anand Louis

• Independent Sets in Semirandom Hypergraphs (WADS 2021)

Jointly with Yash Khanna,  and Anand Louis