Publications

• Triangles Improve 0.878 Approximation for Maxcut (To Appear in APPROX 2025)

Fredie George, Anand Louis, Rameesh Paul

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

Anand Louis, Rameesh Paul, Prasad Raghavendra

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

Anand Louis, Rameesh Paul, Arka Ray

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

Akash Kumar, Anand Louis, Rameesh Paul

• Independent Sets in Semirandom Hypergraphs (WADS 2021)

Yash Khanna, Anand Louis, Rameesh Paul