Visibility testing and counting S Alipour, M Ghodsi, A Zarei, M Pourreza Information Processing Letters 115 (9), 649-654, 2015 | 60* | 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 | 13 | 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 | 9 | 2020 |
On distributed algorithms for minimum dominating set problem, from theory to application S Alipour, E Futuhi, S Karimi arXiv preprint arXiv:2012.04883, 2020 | 8 | 2020 |
Approximation algorithms for probabilistic k-center clustering S Alipour 2020 IEEE International Conference on Data Mining (ICDM), 1-11, 2020 | 7 | 2020 |
On decomposing complete tripartite graphs into 5-cycles ES Mahmoodian, S Alipour, E Mollaahmadi Australas. J. Combin 54, 289-301, 2012 | 7 | 2012 |
Improvements on approximation algorithms for clustering probabilistic data S Alipour Knowledge and Information Systems 63 (10), 2719-2740, 2021 | 6 | 2021 |
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 | 6* | 2017 |
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 | 4 | 2022 |
A geometric algorithm for fault-tolerant classification of COVID-19 Infected People F Sheikhi, S Alipour 2021 26th International Computer Conference, Computer Society of Iran (CSICC …, 2021 | 4 | 2021 |
On the chromatic number of generalized Kneser graphs A Jafari, S Alipour Contributions to Discrete Mathematics 12 (2), 69-76, 2017 | 4* | 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 | 4 | 2015 |
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 | 3 | 2020 |
Upper bounds for the domination numbers of graphs using Turán’s theorem and Lovasz local lemma S Alipour, A Jafari Graphs and Combinatorics 35, 1153-1160, 2019 | 2 | 2019 |
Visibility testing and counting for uncertain segments MA Abam, S Alipour, M Ghodsi, M Mahdian Theoretical Computer Science 779, 1-7, 2019 | 2 | 2019 |
Randomized approximation algorithms for planar visibility counting problem S Alipour, M Ghodsi, A Jafari Theoretical Computer Science 707, 46-55, 2018 | 2 | 2018 |
Relative fractional independence number and its applications S Alipour, A Gohari, M Taziki arXiv preprint arXiv:2307.06155, 2023 | 1 | 2023 |
An improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem S Alipour, M Ghodsi, A Jafari International Computing and Combinatorics Conference, 209-221, 2016 | 1 | 2016 |
Uncertain k-Center Clustering, Revisited: Point Assignment S Alipour, E Shahbazi Gholiabad, M Amin Raeisi International Conference on Knowledge Science, Engineering and Management …, 2024 | | 2024 |
Leveraging ChatGPT for Adaptive Learning through Personalized Prompt-based Instruction: A CS1 Education Case Study M Abolnejadian, S Alipour, K Taeb Extended Abstracts of the CHI Conference on Human Factors in Computing …, 2024 | | 2024 |