Biography

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.

I'm currently looking to recruit graduate students. Students with a strong background and interest in theoretical computer science are encouraged to contact me with their CV and a copy of their B.Sc/M.Sc transcripts.

Research Interests

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. 

Teaching

Contact