Mahya Jamshidian

About Me

I am Ph.D. Candidate in the Theory Group at the University of Alberta, where I am fortunate to be advised by Zachary Friggstad. I completed my undergraduate degree in computer engineering at Isfahan University of Technology, and my master’ degree in computing science at University of Alberta, with Zac Friggstad. You can find my CV here. I am interested in theoretical computer science, specifically on design and analysis of Approximation Algorithms, Combinatorial Optimization, and Hardness Analysis.

Publications

A Polynomial-Time Approximation for Pairwise Fair k-Median Clustering
Sayan Bandyapadhyay, Eden Chlamtáč, Zachary Friggstad, Mahya Jamshidian, Yury Makarychev, Ali Vakilian
arXiv preprint

A Constant-Factor Approximation for Pairwise Fair k-Center Clustering
Sayan Bandyapadhyay, Tianzhi Chen, Zachary Friggstad, Mahya Jamshidian
IPCO, 2025

Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters
Z. Friggstad, M. Jamshidian
ESA, 2022

BoxOff is NP-Complete
R. Hearn, R. Hayward, M. Jamshidian
Advances in Computer Games , 2021

The Neglected Bi-Threshold Aspect of Human Decision-Making: Equilibrium Analysis
M. Jamshidian, Z. Maleki, P. Ramazi
IEEE Conference on Decision and Control (CDC) , 2021

Theses

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
M. Jamshidian
Master’s Thesis, UofA, 2022