About Me

I am a Ph.D. student in the Khoury College of Computer Sciences at Northeastern University. I am advised by Soheil Behnezhad.

I joined Khoury College in 2023, focusing on graph algorithms in sublinear models, I am particularly interested in Correlation Clustering and Matching problems.

Prior to my Ph.D., I worked as a research intern at ISTA, working on algorithms and computational geometry and also worked as a research intern at MPI for Computer Science, working on fairness in clustering. I got my bachelor's in Sharif University of Technology in computer engineering. I was awarded the gold medal in the 37th Iranian National Mathematical Olympiad in 2018.

Publications

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs (FOCS 24)

Coauthors: Soheil Behnezhad, Alma Ghafari

Abstract: We present a new approach for fully dynamic matching in graphs and introduce ordered Ruzsa-Szemerédi graphs as a tool to achieve our results.

Fully Dynamic Correlation Clustering: Breaking 3-Approximation

Coauthors: Soheil Behnezhad, Moses Charikar, Vincent Cohen-Addad, Alma Ghafari, Weiyun Ma

Abstract: This paper addresses the problem of fully dynamic correlation clustering, presenting algorithms that break the 3-approximation barrier.