Zahra Parsaeian

Zahra Parsaeian is a graduate student in Computer Science at Universität des Saarlandes and a researcher at the Max-Planck-Institut für Informatik. Her primary affiliation is with the Algorithms and Complexity department. She focuses on theoretical computer science, including algorithm design, distributed algorithms, computational geometry, and parameterized algorithms.

Research Interests: Zahra's work emphasizes graph algorithms, distributed systems, and computational geometry. Her recent projects include optimizing diameter computation in geometric intersection graphs and exploring round-optimal consensus protocols in distributed networks.

Publications: Her articles highlight advancements in distributed computing and algorithmic theory, such as deterministic ruling set algorithms and laminar matroid secretary problems. These contributions address core challenges in algorithmic efficiency and scalability.

Teaching: She has served as a tutor for Parameterized Algorithms at IIT Madras and held other tutoring roles at Isfahan University of Technology.

Labs/Teams: Affiliated with the Max Planck Algorithms and Complexity group, contributing to foundational research in theoretical computer science.