Scholar
Kamyar Khodamoradi
Google Scholar ID: 755lTHoAAAAJ
University of Regina
Approximation Algorithms
Combinatorial Optimization
Hardness of Approximation
Algorithmic Graph Theory
Randomized Algorithm
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
168
H-index
7
i10-index
6
Publications
20
Co-authors
25
list available
Publications
3 items
Burning Signed Graphs
2026
Cited
0
Distance-based Learning of Hypertrees
2025
Cited
0
The Computational Complexity of Almost Stable Clustering with Penalties
2025
Cited
0
Resume
Research Experience
Currently Assistant Professor, Department of Computer Science, University of Regina, Canada
Former visiting postdoctoral researcher at University of British Columbia (UBC), hosted by Bruce Shepherd
Former postdoctoral researcher at Aalto University, Finland, in the theory group, hosted by Parinya Chalermsook
Former postdoc in DFG project at Julius-Maximilians-Universität Würzburg (JMU), Germany, hosted by Joachim Spoerhase
Former postdoctoral researcher in approximation algorithms at IDSIA (USI/SUPSI), Lugano, Switzerland, hosted by Fabrizio Grandoni
Former two-year postdoc in the Algorithmics group at University of Alberta, Canada, hosted by Zachary Friggstad and Mohammad R. Salavatipour
Co-authors
14 total
Mohammad Salavatipour
Professor of Computer Science, University of Alberta
Joachim Spoerhase
Department of Computer Science, University of Liverpool, UK
Ameet Gadekar
CISPA Helmholtz Center for Information Security
Parinya Chalermsook
The University of Sheffield
Arash Rafiey
Indiana State University
Roohani Sharma
Max Planck Institute for Informatics
Jarek Byrka
University of Wroclaw
Dániel Marx
CISPA Helmholtz Center for Information Security