Morteza Monemizadeh

Dr. Morteza Monemizadeh is an Assistant Professor at the Algorithms department within the Mathematics and Computer Science school. His research focuses on algorithm design, with emphasis on approximation algorithms, computational geometry, and massively parallel computing.

Research Areas:

• Geometric intersection graphs
• Clustering algorithms
• Travelling Salesman Problem
• Dimensionality reduction
• Exact algorithm design
• Massively Parallel Computing (MPC)

Publications Trends: Recent works address equilibrium points in machine learning, clique-based separators in computational geometry, and clustering in polygonal domains. His contributions span theoretical algorithms and practical implementations in peer-reviewed journals and conferences like Algorithmica, ISAAC, and IPDPS.

Collaborations: Active collaborations with researchers like Dr. Mark de Berg and Dr. Sándor Kisfaludi-Bak on geometric algorithms and approximation techniques are evident from his research outputs.