Zahra Parsaeian Albert-Ludwigs-Universität Institut für Informatik Georges-Köhler-Allee 106 D - 79110 Freiburg im Breisgau Room: Fax: 106-00-004 +49 761 - 203 67412 Email: zahra.parsaeian@cs.uni-freiburg.de

About me

I am currently a third-year PhD student at the University of Freiburg, where I am part of the Algorithms and Complexity group. I hold a Master’s degree (M.Sc.) in Computer Science from Saarland University, with a research affiliation at the Max Planck Institute for Informatics in Saarbrücken, Germany. Prior to that, I earned my Bachelor’s degree (B.Sc.) in Software Engineering from Isfahan University of Technology in Iran.
My research interests are focused on graph theory, distributed algorithms, and game theory.

You can find my CV here.

Publications

Conference Papers (arXiv version)


• An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the K-Means Problem
  Vincent Cohen-Addad, Fabian Kuhn, and Zahra Parsaeian
  ACM-SIAM Symposium on Discrete Algorithms (SODA 2026)
  
• On the Complexity of Distributed Edge Coloring and Orientation
  Sebastian Brandt, Fabian Kuhn, and Zahra Parsaeian
  Conference on Principles of Distributed Systems (OPODIS 2025)
  
• Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees
  Marc Fuchs, Diana Ghinea, and Zahra Parsaeian
  ACM Symposium on Principles of Distributed Computing (PODC 2025)
  
• Massively Parallel Ruling Set Made Deterministic
  Jeff Giliberti and Zahra Parsaeian
  International Symposium on Distributed Computing (DISC 2024)
  
• Laminar Matroid Secretary: Greedy Strikes Back
  Zhiyi Huang, Zahra Parsaeian and Zixuan Zhu
  European Symposium on Algorithms (ESA 2024)
  (Track S Best Paper Award)
  
• Brief Announcement: Massively Parallel Ruling Set Made Deterministic
  Jeff Giliberti and Zahra Parsaeian
  ACM Symposium on Principles of Distributed Computing (PODC 2024)
  
• Towards sub-quadratic diameter computation in geometric intersection graphs
  Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann, André Nusser, and Zahra Parsaeian
  Symposium on Computational Geometry (SoCG 2022)
  

You can see the complete list here

Outreach

• Greedy Strikes Back: A 4.75-Competitive Algorithm for the Laminar Matroid Secretary Problem
  Guest blog post for The Matroid Union, May 2025.

Teachings

• Graduate Course "Distributed Graph Algorithms" (winter 2025/26)
• Graduate Course "(Theory of) Distributed Systems" (Summer 2025)
• Seminar "Distributed Algorithms" (Summer 2025)
• Seminar "Algorithms and Complexity" (Winter 2024/25)
• Graduate Course "Theoretical Computer Science - Bridge Course" (winter 2024/25)
• Graduate Course "Theoretical Computer Science - Bridge Course" (Summer 2024)
• Graduate Course "Theoretical Computer Science - Bridge Course" (Winter 2023/24)
• Seminar "Distributed Computing Reading Group" (Winter 2023/24)
• Graduate Course "(Theory of) Distributed Systems" (Summer 2023)
• Seminar "Algorithms and Complexity Reading Group " (Summer 2023)