@University of Michigan
GSI for EECS 598: Machine Learning Theory
@IIT KGP
TA for CS60025: Algorithmic Game Theory
TA for CS60094: Computational Number Theory
Approximating Small Sparse Cuts
UMass Amherst Theory Group, April 2025
Unbreakable Decomposition in Close-to-Linear Time
Dagstuhl Seminar: New Tools in Parameterized Complexity: Paths, Cuts and Decomposition, Oct 2024
Separating k-Median from the Supplier Version
A Polynomial Kernel for Deletion to Ptolemaic Graphs
IPEC 2021 video
FOCS, STOC, SODA, SICOMP, ICALP, WG, FSTTCS, APPROX