Mohammad Reza Kazemi

According to our database, Mohammad Reza Kazemi authored at least 8 papers between 2012 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

On approximability of minimum color-spanning ball in high dimensions.

Mohammad Reza Kazemi, Ali Mohades, Payam Khanteimouri

Discret. Appl. Math., 2020

2019

A Time-space Trade-off for Computing the Geodesic Center of a Simple Polygon.

Pardis Kavand, Ali Mohades, Mohammad Reza Kazemi

CoRR, 2019

2018

Approximation algorithms for color spanning diameter.

Mohammad Reza Kazemi, Ali Mohades, Payam Khanteimouri

Inf. Process. Lett., 2018

2016

Efficiently approximating color-spanning balls.

Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi

Theor. Comput. Sci., 2016

2014

Structure-Based Analysis of Protein Binding Pockets Using Von Neumann Entropy.

Negin Forouzesh, Mohammad Reza Kazemi, Ali Mohades

Proceedings of the Bioinformatics Research and Applications - 10th International Symposium, 2014

2013

Computing the Smallest Color-Spanning Axis-Parallel Square.

Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Spanning Colored Points with Intervals.

Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Computation of lucky number of planar graphs is NP-hard.

Arash Ahadi, Ali Dehghan, Mohammad Reza Kazemi, E. Mollaahmadi

Inf. Process. Lett., 2012