1. Finding Small Dijoins in Transitive Closure Time (FSTTCS 2025)
  2. Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness (STOC 2025)
  3. Maximal $k$-edge-connected partition in weighted graphs via local random contraction (SODA 2023)
  4. Vertex cover in the sliding window model (Masters Thesis)
  5. Computerized detection and semantic characterization of trends in digital media content (Internship at Adobe)