Computation of lucky number of planar graphs is NP-hard. - Arash Ahadi; Ali Dehghan 001; Mohammad Reza Kazemi 001; E. Mollaahmadi (Inf. Process. Lett., 2012)

Spanning Colored Points with Intervals. - Payam Khanteimouri; Ali Mohades; Mohammad Ali Abam; Mohammad Reza Kazemi 001 (CCCG, 2013)

Computing the Smallest Color-Spanning Axis-Parallel Square. - Payam Khanteimouri; Ali Mohades; Mohammad Ali Abam; Mohammad Reza Kazemi 001 (ISAAC, 2013)

Structure-Based Analysis of Protein Binding Pockets Using Von Neumann Entropy. - Negin Forouzesh; Mohammad Reza Kazemi 001; Ali Mohades (ISBRA, 2014)

Efficiently approximating color-spanning balls. - Payam Khanteimouri; Ali Mohades; Mohammad Ali Abam; Mohammad Reza Kazemi 001 (Theor. Comput. Sci., 2016)

Approximation algorithms for color spanning diameter. - Mohammad Reza Kazemi 001; Ali Mohades; Payam Khanteimouri (Inf. Process. Lett., 2018)

A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon. - Pardis Kavand; Ali Mohades; Mohammad Reza Kazemi 001 (CoRR, 2019)

On approximability of minimum color-spanning ball in high dimensions. - Mohammad Reza Kazemi 001; Ali Mohades; Payam Khanteimouri (Discret. Appl. Math., 2020)