Alipour Sharareh Malek

Dr. Sharareh Alipour is a computer scientist whose research lies at the intersection of algorithms, combinatorial optimization, data science, and distributed computing, with particular focus on sublinear and approximation algorithms, randomized techniques, and computational geometry.

She has held postdoctoral and senior research positions at the Institute for Research in Fundamental Sciences (IPM, Tehran) and IST Austria, and has collaborated extensively with international researchers. Her contributions have been recognized through publications at leading venues such as SODA, STACS, ICDM, AAMAS, CHI, PODS, and Discrete Mathematics.

Beyond her research, Dr. Alipour is actively engaged in academic service, mentorship, and promoting women in computer science. She has delivered invited talks at Princeton University’s Women in Theory Workshop and led initiatives that support diversity and inclusion in academia.

Design and Analysis of Algorithms

Approximation & Randomized Algorithms

Sublinear Algorithms

Computational Geometry

Graph Theory and its Applications

Combinatorial Optimization

Data Science

Distributed Computing

Assistant Professor, Computer Science, TeIAS (Feb. 2022 – present)

Senior Postdoctoral Fellow, School of Computer Science, IPM, Tehran (2019–2022)

Postdoc Visitor, Institute of Science and Technology, Austria (2019–2020)

Postdoctoral Fellow, School of Computer Science, IPM, Tehran (2016–2019)

Ph.D. in Computer Engineering, Sharif University of Technology, Tehran (2011–2016)

1. Thesis: Efficient Algorithms for Visibility Testing of Objects and Counting
2. Advisor: Dr. Mohammad Ghodsi

M.S. in Computer Science, Sharif University of Technology (2009–2011)

1. Thesis: Visibility Counting and Testing
2. Advisor: Dr. Alireza Zarei

B.S. in Computer Science, Sharif University of Technology (2005–2009)

1. Thesis: Study of Hurst Parameter Estimation of Network Traffic
2. Advisor: Dr. Amir Hossein Jahangir

1. Alipour, S., Baghestani, K., Sahraie, S., Mirzaie, M. “Geometric Freeze-Tag Problem.” AAMAS (to appear), 2025.
2. Alipour, S., Farokhnejad, E., Momke, T. “Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model.” STACS (to appear), 2025.
3. Alipour, S., Ebrahimi, S. “A New Index for Computer Science Conferences and Its Applications: The S-Index.” ICDM Workshops, 2024.
4. Alipour, S., Shahbazi, E., Raeisi, M. A. “Uncertain k-Center Clustering, Revisited: Point Assignment.” KSEM, 2024.
5. Alipour, S., Jafari, A., Mazidi, M., Najafian, A. “Partial Coloring Complex, Vertex Decomposability and Tverberg’s Theorem with Constraints.” SODA, 2024.
6. Alipour, S., Parsa, S. “Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles.” Discrete Mathematics, Algorithms and Applications, 2023.
7. Alipour, S., Jafari, A. “Improvements on the k-Center Problem for Uncertain Data.” PODS, 2018.
8. Abam, M., Alipour, S., Ghodsi, M., Mahdian, M. “Visibility Testing and Counting for Uncertain Segments.” Theoretical Computer Science, 2019.

(Full list includes 40+ peer-reviewed publications across algorithms, graph theory, and computational geometry.)

TeIAS: Randomized and Approximation Algorithms (2024), Advanced Algorithms (2022–2024), Advanced Data Mining (2023)

Sharif University of Technology: Data Structures & Algorithms, Graph Theory, Distributed Algorithms, Discrete Mathematics, Programming Languages (C/C++/Java/Python) (2013–2022)

Other: Mentoring at DIMACS REU (Rutgers University, 2014), Teaching in high schools & institutes (2005–2011)

Ranked 1st, Ph.D. Entrance Exam in Computer Engineering, Iran (2011)

Ranked 22nd, M.S. Entrance Exam in Computer Science, Iran (2009)

Ranked 921st out of 343,000, National University Entrance Exam, Iran (2005)