I am a 3rd year PhD student in Theoretical Computer Science at Northeastern University. I’m honored to be advised by Mahsa Derakhshan.

My research interests lie in online algorithms and graph algorithms. A current line of my work focuses on randomized greedy matching algorithms, where I develop new analytical tools to better understand their behavior and performance in general graphs.

Preprints

• Improved Bounds for Online Matching on General Graphs with Batched Edge Arrivals
  Mahsa Derakhshan, Tao Yu
  Under Submission

• A Multi-Victim Analysis for Weighted Randomized Greedy Matching On General Graphs
  Mahsa Derakhshan, Tao Yu
  Under Submission

Publications

• A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
  Mahsa Derakhshan, Tao Yu
  (STOC 2026) 58th ACM Symposium on Theory of Computing
  arXiv

• Improved Approximation for Ranking on General Graphs
  Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
  (SODA 2026) The 37th Annual ACM-SIAM Symposium on Discrete Algorithms
  arXiv

• A Simple Analysis of Ranking in General Graphs
  Mahsa Derakhshan, Mohammad Roghani, Mohammad Saneian, Tao Yu
  (SOSA 2026) ACM-SIAM Symposium on Simplicity in Algorithms
  arXiv