About Me
I am a first year Ph.D. at the University of Waterloo in the Algorithms and Complexity group, where I am fortunate to be advised by Sepehr Assadi and Rafael Oliveria. I got my Bachelor’s Degree in Computer Engineering with a minor in Mathematics from Sharif University of Technology. My alternative name is Reza Hosseini Dolatabadi.
I am broadly interested in theoretical computer science with a focus on questions at the intersection of algorithms and complexity theory. I also like to think on extremal and algebraic combinatorics problems.
Internship
In Summer 2023, I was a research intern at Hong Kong University of Science and Technology (HKUST), where I worked under the supervision of Mordecai Golin. We published two papers in which we solved an optimization problem about minimum-cost Markov chains, which had applications in lossless coding.
Publications
Reza Hosseini Dolatabadi, Saieed Akbari, Mohsen Jamaali, Sandi Klavžar, Nazanin Movarraei.
On the Δ-edge stability number of graphs.
European Journal of Combinatorics, vol. 127, p. 104167, 2025.Mordecai J Golin, Reza Hosseini Dolatabadi, Arian Zamani.
A (Weakly) Polynomial Algorithm for AIVF Coding.
In 2024 IEEE International Symposium on Information Theory (ISIT), pp. 67–72, 2024.Mordecai J Golin, Reza Hosseini Dolatabadi, Arian Zamani.
Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes.
In 2024 IEEE International Symposium on Information Theory (ISIT), pp. 61–66, 2024.Hossein Esfandiari, Samira Hossein Ghorban, Reza Hosseini Dolatabadi, Mahdi Qaempanah.
What is the Chance of Being so Unfair?
In Companion Proceedings of the ACM on Web Conference 2025, pp. 957–960, 2025.
Extra Curricular Activities
I enjoy teaching mathematics to high school students, in particular those who are participating in mathematical olympiad competitions. I’ve been teaching Number Theory and Combinatorics to Iranian IMO participants since 2020. I also proposed several problems that appeared in the Iranian National Mathematical Olympiad contests.