Assistant Professor
Department of Computer Science
University of Regina
I am an assistant professor in the Department of Computer Science at the University of Regina. I study various problems in theoretical computer science.
Before joining the University of Regina, I was a (visiting) postdoctoral researcher at the Department of Computer Science, UBC, hosted by Bruce Shepherd. The visit overlapped with my postdoctoral researcher appointment at the Department of Computer Science in Aalto university, Espoo, Finland, where I was a member of the theory group, hosted by Parinya Chalermsook.
Before Aalto university, I was a postdoc in the DFG project, "Approximation algorithms for combinatorial optimization problems with packing constraints" (SP 1468/3-1), hosted by Joachim Spoerhase at Chair of Computer Science I - Algorithms and Complexity, JMU Würzburg, Germany.
I was also a postdoctoral researcher in approximation algorithms at USI/SUPSI, IDSIA, in Lugano, Switzerland. I was hosted by Fabrizio Grandoni.
Prior to that, I spent two years as a postdoc in the Algorithmics groups at the computing science department, University of Alberta, Edmonton, Canada. I was hosted by Zachary Friggstad and Mohammad R. Salavatipour.
I obtained my Ph.D. in computing science from Simon Fraser University in Burnaby, Canada, under the supervision of Ramesh Krishnamurti and Binay Bhattacharya. I hold an M.Sc. in Computer Engineering from Sharif University of Technology, Iran, supervised by Mohammad Ghodsi.
You can find my CV here.
Update: Our paper "Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-means" has been accepted to SICOMP. The conference version appeared in SODA'19.
Our paper "Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces" has been accepted to ICALP 2024.
Our paper "Parameterized Approximation Schemes for Clustering with General Norm Objectives" has been accepted to FOCS 2023.
I am broadly interested in theoretical computer science. My focus is on approximation algorithms and combinatorial optimization. Recently, I have worked on problems on the hardness of approximation as well as approximation algorithms for set packing, clustering, and scheduling problems.
Discrete Computational Structures (CS 310) - University of Regina, Winter 2024
Approximation Algorithms - Aalto University, Spring 2022
Seminars on Mathematical Foundations of Data Science - JMU Würzburg, Summer 2021
Approximation Algorithms - JMU Würzburg, Fall 2020
Program Committee
Address: 308.25 College West Building, University of Regina, 3737 Wascana Parkway, Regina, Saskatchewan, S4S 0A2, Canada
Email: [First name].[Last name]@[uregina.ca or gmail.com]
Tel: +1 (306) 337-8442