Talks

• Robust Algorithms for Recovering Planted r-Colorable Graphs
  38th Conference on Learning Theory (COLT), ENS Lyon, France, July 2025

• Algorithms for Recovering Planted r-Colorable Graph
  Theory Seminar, IIT Delhi, April 2024

• Recovery Algorithms for Planted Semirandom Graph and Hypergraph Problems

Purdue University Theory Seminar, jointly with U.Mich, Sep 2022 (Presented Online)

• Exact Recovery Algorithm for Planted Bipartite Graph in Semirandom Graphs
  49th EATCS International Colloquium on Automata, Languages and Programming (ICALP), Paris, France, July 2022

• Independent Sets in Semirandom Hypergraphs
  ACM-India 16th Academic Research and Careers for Students Symposium (ARCS), Feb 2022 (Presented Online)

• Independent Sets in Semirandom Hypergraphs
  17th Algorithms and Data Structures Symposium (WADS), Aug 2021 (Presented Online)

• Independent Sets in Semirandom Hypergraphs
  12th EECS Students Research Symposium, May 2021 (Presented Online)