Chaitanya Nalam

Chaitanya Nalam

About me

I am currently a PhD student at the University of Michigan, Ann Arbor. I am fortunate to be advised by Thatchaphol Saranurak. I graduated with a master’s degree from Rutgers University, New Brunswick, where I was advised by Sepehr Assadi. I completed my undergraduate degree at the Indian Institute of Technology, Madras, where I was advised by Pandu Rangan Chandrasekaran. I am grateful to all my teachers because of whom I am in this position today.

My research interests are graph algorithms, mainly cut and connectivity related problems.

Publications

  1. Joins and ear decompositions beyond graphic matroids
    Preprint, 2026
  2. Finding Small Dijoins in Transitive Closure Time
    FSTTCS 2025
  3. Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
    STOC 2025
  4. Maximal k-edge-connected partition in weighted graphs via local random contraction
    SODA 2023 · Video
  5. Vertex cover in the sliding window model
    Master's thesis
  6. Computerized detection and semantic characterization of trends in digital media content
    Internship at Adobe

Teaching Assistance