Publications

• Recovering Planted Subgraphs in Smoothed Models

Jointly with Pravesh Kothari, Anand Louis, and Prasad Raghavendra

Manuscript

• Refutation vs Recovery: Maximum Independent Set in Sparse Semirandom Hypergraphs

Jointly with Pravesh Kothari, Anand Louis, and Prasad Raghavendra

Manuscript

• Learning-Augmented Online Covering with Multiple Experts

Jointly with Naveen Garg, Amit Kumar, and Serene Rasheed

To appear in Proceedings of 38th ACM-SIAM Symposium on Discrete Algorithms (SODA 2027)

• No SDP Needed for Efficiently Recovering Planted Regular Bipartite Graphs

Jointly with Anand Louis

In Proceedings of 9th SIAM Symposium on Simplicity in Algorithms (SOSA 2026)

• Triangles Improve 0.878 Approximation for Maxcut

Jointly with Fredie George,  and Anand Louis

In Proceedings of 28th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2025)

• Robust Algorithms for Recovering Planted r-Colorable Graphs

Jointly with Anand Louis, and Prasad Raghavendra

In Proceedings of 38th Annual Conference on Learning Theory (COLT 2025)

• Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes

Jointly with Anand Louis, and Arka Ray

In Proceedings of 19th Scandinavian Symposium on Algorithm Theory (SWAT 2024)

• Exact Recovery Algorithm for Planted Bipartite Graph in Semirandom Graphs

Jointly with Akash Kumar,  and Anand Louis

In Proceedings of 49th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2022)

• Independent Sets in Semirandom Hypergraphs

Jointly with Yash Khanna,  and Anand Louis

In Proceedings of 17th Algorithms and Data Structures Symposium (WADS 2021)