Sharareh Alipour

Assistant Professor


Sharareh Alipour received her B.Sc., M.Sc. and Ph.D. from Sharif University, Iran, in 2009, 2011 and 2016, respectively. She was a postdoc at Institute for Research in Fundamental Sciences (IPM) and Institute of Science and Technology, Austria (ISTA).

Research Interests

  • Theoretical Computer Science
  • Algorithm Design
  • Distributes and Sublinear Algorithms
  • Data Mining
  • Graph Theory and Combinatorics
  • Ph.D. Computer Engineering(2011-2016), Sharif University of Technology
  • M.Sc. Computer Science (2009-2011), Sharif University of Technology
  • B.Sc., Computer Science(2005-2009), Sharif University of Technology

Selected Publications:

  • Alipour, S., Elahimanesh, S.,Neshayi, P., Jahanzad, S., Morasafar, P., “A Blockchain Approach to Academic Assessment ”. CHI2022, Late-Breaking Work.
  • Alipour, S., “Improvements on approximation algorithms for clustering probabilistic data”. Knowl. Inf. Syst. 63(10): 2719-2740 (2021)
  • Alipour, S, “Approximation algorithms for probabilistic k-center clustering”. ICDM 2020: 1-11. 2020
  • Alipour, S., Jafari, A., “Brief Announcement: A local constant approximation factor algorithm for minimum dominating set of certain planar graphs”. SPAA 2020: 501- 502. 2020
  • Abam, M., Alipour, S., Ghodsi, M., Mahdian, M, “Visibility Testing and Counting for Uncertain Segments”. Theoretical Computer Science, 779: 1-7 (2019).
  • Alipour, S., Jafari, A, “Improvements on the k-center problem for uncertain data”. PODS 2018: 423-433, 2018.
  • Alipour, S., Ghodsi, M., Jafari, A, “Randomized approximation algorithms for Planar visibility counting problem”. Theoretical Computer Science, 707: 46-55 (2018).

Graduate Courses

  • Graph theory(Sharif)
  • Distributed algorithms seminar(Sharif)

Undergraduate Courses

  • Data structures and algorithms(Sharif)
  • Discrete math (Sharif)
  • Programming language, c, c++, python, java(Sharif)