Postdoc fellow at the Center for Converging Technologies, University of Tehran.
Mohammad Reza Kazemi
Convergent Technologies Research Center, University of Tehran, Northern Kargar st., Tehran, Iran.
+98-21-88339268
mr.[last name]@aut.ac.ir
- Geogarphical Database (Spatial Database)
- Computational Geometry
- Approximation Algorithms
- Graph Algorithms
- 2012 – 2019:
- PhD student in Computer Science at Amirkabir University of Technology
- 2007 – 2010:
- MSc in Computer Science at Sharif University of Technology
- 2003 – 2007:
- BSc in Mathematics at Lorestan University
- Mohammad Reza Kazemi, Ali Mohades, Payam Khanteimouri, On approximability of minimum color-spanning ball in high dimensions. Discrete Applied Mathematics. To appear.
- Mohammad Reza Kazemi, Ali Mohades, Payam Khanteimouri Approximation algorithms for color spanning diameter. Information Processing Letters. 135: 53-56 (2018)
- Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi, Saeed Seddighin Effiiently computing the smallest axis-parallel squares spanning all colors. Scientia Iranica 24(3): 1325-1334 (2017)
- Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi Efficiently approximating color-spanning balls. Theoretical Computer Science 634: 120-126 (2016)
- Negin Forouzesh, Mohammad Reza Kazemi, Ali Mohades Structure-Based Analysis of Protein Binding Pockets Using Von Neumann Entropy. ISBRA 2014: 301-309
- Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi, Spanning Colored Points with Intervals. CCCG 2013
- Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi, Computing the Smallest Color-Spanning Axis-Parallel Square. ISAAC 2013: 634-643
- Arash Ahadi, Ali Dehghan, M. Kazemi, E. Mollaahmadi, Computation of lucky number of planar graphs is NP-hard. Information Processing Letters 112(4): 109-112 (2012)