Nima Dolatabadi

Nima Dolatabadi

PhD student at UCPH

About Me

I am a PhD student in Computer Science at the University of Copenhagen, where I am a member of the Basic Algorithms Research Copenhagen (BARC) group and I am very fortunate to be advised by Mikkel Thorup.

I am broadly interested in theoretical computer science, with a focus on algorithms and complexity theory. My research interests include graph algorithms, distributed and streaming algorithms, and computational complexity. I also like to think on extremal and algebraic combinatorics problems.

I received my Bachelor’s degree in Computer Engineering with a minor in Mathematics from Sharif University of Technology. I have also published under the name Reza Hosseini Dolatabadi. My alternative and formal name is Seyedreza Hosseinidolatabadi.

Internship

National University of Singapore

Research Assistant
February 2026 – August 2026
School of Computing, NUS
Hosted by Yi-Jun Chang

I worked on problems in distributed graph algorithms, focusing on the design and analysis of efficient graph coloring algorithms in distributed models of computation.

Hong Kong University of Science and Technology

Research Intern
July 2023 – September 2023
Supervised by Mordecai J. Golin

I worked on optimization problems involving minimum-cost Markov chains using computational geometric techniques. This work was originally motivated by its applications to lossless coding.

Publications

  1. 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.
    arXiv · DOI

  2. 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.
    arXiv · DOI

  3. Reza Hosseini Dolatabadi, Saieed Akbari, Mohsen Jamaali, Sandi Klavžar, Nazanin Movarraei.
    On the $\Delta$-edge stability number of graphs.
    European Journal of Combinatorics, vol. 127, p. 104167, 2025.
    arXiv · Journal

  4. Hossein Esfandiari, Samira Hossein Ghorban, Reza Hosseini Dolatabadi, Mahdi Ghaempanah.
    What is the Chance of Being so Unfair?
    In Companion Proceedings of the ACM on Web Conference 2025, pp. 957–960, 2025.
    OpenReview · DOI

Honors and Awards

  • Second Prize, First Undergraduate Research Seminar in Graph Theory, Sharif University of Technology, 2024
  • Bronze Medal, International Mathematical Olympiad (IMO), 2020
  • Bronze Medal, Romanian Master of Mathematics (RMM), 2020
  • Silver Medal, Asian Pacific Mathematical Olympiad (APMO), 2020
  • Gold Medal, Iranian National Mathematics Olympiad, 2019

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 have also proposed several problems that appeared in the Iranian National Mathematical Olympiad contests.