sharareh alipour
sharareh alipour
Verified email at
Cited by
Cited by
Visibility testing and counting
S Alipour, M Ghodsi, A Zarei, M Pourreza
Information Processing Letters 115 (9), 649-654, 2015
Improvements on the k-center problem for uncertain data
S Alipour, A Jafari
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
A local constant approximation factor algorithm for minimum dominating set of certain planar graphs
S Alipour, A Jafari
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
Approximation algorithms for visibility computation and testing over a terrain
S Alipour, M Ghodsi, U Güdükbay, M Golkari
Applied Geomatics 9, 53-59, 2017
On distributed algorithms for minimum dominating set problem, from theory to application
S Alipour, E Futuhi, S Karimi
arXiv preprint arXiv:2012.04883, 2020
On decomposing complete tripartite graphs into 5-cycles
ES Mahmoodian, S Alipour, E Mollaahmadi
Australas. J. Combin 54, 289-301, 2012
Approximation algorithms for probabilistic k-center clustering
S Alipour
2020 IEEE International Conference on Data Mining (ICDM), 1-11, 2020
On the chromatic number of generalized Kneser graphs
A Jafari, S Alipour
Contributions to Discrete Mathematics 12 (2), 69-76, 2017
Weak visibility counting in simple polygons
MN Bygi, S Daneshpajouh, S Alipour, M Ghodsi
Journal of Computational and Applied Mathematics 288, 215-222, 2015
Improvements on approximation algorithms for clustering probabilistic data
S Alipour
Knowledge and Information Systems 63 (10), 2719-2740, 2021
Upper bounds for k-tuple (total) domination numbers of regular graphs
S Alipour, A Jafari, M Saghafian
Bulletin of the Iranian Mathematical Society 46 (2), 573-577, 2020
Visibility testing and counting for uncertain segments
MA Abam, S Alipour, M Ghodsi, M Mahdian
Theoretical Computer Science 779, 1-7, 2019
Randomized approximation algorithms for planar visibility counting problem
S Alipour, M Ghodsi, A Jafari
Theoretical Computer Science 707, 46-55, 2018
Upper Bounds for the Domination Numbers of Graphs Using Turán’s Theorem and Lovász Local Lemma
S Alipour, A Jafari
Graphs and Combinatorics 35, 1153-1160, 2019
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem
S Alipour, M Ghodsi, A Jafari
Computing and Combinatorics: 22nd International Conference, COCOON 2016, Ho …, 2016
A Blockchain Approach to Academic Assessment
S Alipour, S Elahimanesh, S Jahanzad, P Morassafar, SP Neshaei
CHI Conference on Human Factors in Computing Systems Extended Abstracts, 1-6, 2022
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
S Alipour, S Parsa
Discrete Mathematics, Algorithms and Applications, 2250063, 2022
Brief Announcement: Distributed Algorithms for Minimum Dominating Set Problem and Beyond, a New Approach
S Alipour, M Salari
36th International Symposium on Distributed Computing (DISC 2022), 2022
On Planar Visibility Counting Problem
S Alipour
arXiv preprint arXiv:2103.08058, 2021
On distributed algorithms for minimum dominating set problem and beyond
S Alipour, M Salari
arXiv preprint arXiv:2103.08061, 2021
The system can't perform the operation now. Try again later.
Articles 1–20