| Computation of lucky number of planar graphs is NP-hard A Ahadi, A Dehghan, M Kazemi, E Mollaahmadi Information processing letters 112 (4), 109-112, 2012 | 40 | 2012 |
| Computing the smallest color-spanning axis-parallel square P Khanteimouri, A Mohades, MA Abam, MR Kazemi International Symposium on Algorithms and Computation, 634-643, 2013 | 25 | 2013 |
| Approximation algorithms for color spanning diameter MR Kazemi, A Mohades, P Khanteimouri Information Processing Letters 135, 53-56, 2018 | 7 | 2018 |
| Structure-Based Analysis of Protein Binding Pockets Using Von Neumann Entropy N Forouzesh, MR Kazemi, A Mohades International Symposium on Bioinformatics Research and Applications, 301-309, 2014 | 5 | 2014 |
| Spanning Colored Points with Intervals. P Khanteimouri, A Mohades, MA Abam, MR Kazemi CCCG, 2013 | 5 | 2013 |
| Efficiently approximating color-spanning balls P Khanteimouri, A Mohades, MA Abam, MR Kazemi Theoretical Computer Science 634, 120-126, 2016 | 3 | 2016 |
| On approximability of minimum color-spanning ball in high dimensions MR Kazemi, A Mohades, P Khanteimouri Discrete Applied Mathematics 279, 188-191, 2020 | 2 | 2020 |
| Effiiently computing the smallest axis-parallel squares spanning all colors P Khanteimouri, A Mohades, MA Abam, MR Kazemi, S Sedighin Scientia Iranica 24 (3), 1325-1334, 2017 | 1 | 2017 |
| A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon P Kavand, A Mohades, MR Kazemi arXiv preprint arXiv:1908.11260, 2019 | | 2019 |
