Publications
o M. R. Kazemi, A. Mohades, P. Khanteimouri: On Approximability of Minimum Color-Spanning Ball in High Dimensions. Discrete Applied Mathematics. 279;188:191 ,2020.
o M. R. Kazemi, A. Mohades, P. Khanteimouri: Approximation Algorithms for Color Spanning Diameter. Information Processing Letters. 1;135:53-6 ,2018.
o P. Khanteimouri, A. Mohades, M. A. Abam, M. R. Kazemi, S. Sedighin: Efficiently Computing the Smallest Axis-Parallel Squares Spanning All Colors. SCIENTIA. IRANICA 24.3 1325-1334 ,2017
o P. Khanteimouri, A. Mohades, M. A. Abam, M. R. Kazemi: Efficiently approximating color-spanning balls.Theoretical Computer Science, 634: 120-126 ,2016
o M. Davoodi, A. Mohades, F. Sheikhi and P. Khanteimouri: Data Imprecision Under Lambda-Geometry Model, Information Sciences, 295: 126–144 ,2015
o M. Davoodi, M. Abedin, B. Banyassady, P. Khanteimouri, A. Mohades: An optimal algorithm for two robots path planning problem on the grid. Robotics and Autonomous Systems, 61(12): 1406-1414 ,2013
o V. Azadehgan, P. Khanteimouri, S. Akbari, N. Ghandehari: A Collaborative Approach for LA-DHBMO, Applied Mathematics, Vol. 3 No. 10A, 2012, pp. 1442–1447. doi:10.4236/am.2012.330203
o J. Hasheminejad, P. Khanteimouri, A. Mohades: Computing the Smallest Color-Spanning Equaliteral Triangle.EUROCG, 2015
o P. Khanteimouri, A. Mohades, M. A. Abam, M. R. Kazemi: Computing the Smallest Color-Spanning Axis-Parallel Square. Springer, Lecture Notes in Computer Science, 24th International Symposium on Algorithms and Computation, ISAAC 2013: 634-643
o P. Khanteimouri, A. Mohades, M. A. Abam, M. R. Kazemi: Spanning Colored Points with Intervals, Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8-10, 2013
o M. Davoodi, P. Khanteimouri, F. Sheikhi and A. Mohades: Data Imprecision under Geometry: Finding the Largest Axis-Aligned Bounding Box. EUROCG, 2011