Research Interests
- Approximation Algorithms
- Machine Learning
- Combinatorial Optimization
Teaching
- Machine Learning (Fall 2018; Spring 2020; Fall 2020)
- Data Structures and Algorithms (Fall 2018; Fall 2020)
- Algorithm Design (Fall 2020)
- Data Science Algorithms (Fall 2019)
- Advanced Programming in Python (Spring 2019; Spring 2020)
- Programming in Python (Fall 2018; Fall 2019)
- Programming in C++ (Spring 2018)
- Calculus (Spring 2018)
Publications (selected)
-
Approximation Schemes for Clustering with Outliers. (with Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour)
In ACM Transactions on Algorithms, 2019. -
Scheduling Problems over Network of Machines. (with Z. Friggstad, A. Gholestanian, K. Khodamoradi, C. Martin, M. Rahgosha, M. Salavatipour, Y. Zhang)
In Journal of Scheduling, 2018. -
LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. (with Zachary Friggstad, Mohammad R. Salavatipour, Jose A. Soto)
In Algorithmica, 2018. -
Approximation Schemes for Clustering with Outliers. (with Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour)
In Proceedings of ACM-SIAM Symposium in Discrete Algorithms (SODA), 2018. -
Local Search Yields a PTAS for k-Means in Doubling Metrics. (with Zachary Friggstad, Mohammad R. Salavatipour)
In SIAM Journal on Computing, 2017. -
Scheduling Problems over Network of Machines. (with Z. Friggstad, A. Gholestanian, K. Khodamoradi, C. Martin, M. Rahgosha, M. Salavatipour, Y. Zhang)
In Proceedings of APPROX-RANDOM, 2017. -
Exact Approaches for Designing Multi-Facility Buy-at-Bulk Networks. (with Ashwin Arulselvan, Wolfgang A. Welz)
In INFORMS Journal on Computing, 2017. -
Local Search Yields a PTAS for k-Means in Doubling Metrics. (with Zachary Friggstad, Mohammad R. Salavatipour)
In Proceedings of FOCS, 2016. -
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding. (with Zachary Friggstad, Mohammad R. Salavatipour)
In Proceedings of SWAT, 2016. -
Combinatorial Approximation Algorithms for Buy-at-Bulk Connected Facility Location Problems. (with Andreas Bley)
In Discrete Applied Mathematics, 2016. -
LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design. (with Zachary Friggstad, Mohammad R. Salavatipour, Jose A. Soto)
In Proceedings of WADS, 2015. -
Network Design with Facility Location: Approximation and Exact Techniques. ( committee: Andreas Bley, Martin Skutella, Mohammad R. Salavatipour. )
PhD Thesis, Technical University of Berlin, March 2015.
For a complete list of my publications see my page at Google Scholar or DBLP
Workshops (organization) :
- co-organizer of the workshop Data Science and Combinatorial Algorithms (24th-25th April 2019).
Some Talks
-
Approximation Schemes for Clustering Problems.
IPM, Tehran, March 2018. -
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.
University of Reykjavik, Iceland, June 2016. -
LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.
University of Victoria, Canada, August 2015. -
Exact Approaches for Designing Multi-Sink Buy-at-Bulk Networks.
Humboldt University of Berlin, Germany, December 2014. -
Combinatorial Approximation Algorithms for Buy-at-Bulk Connected Facility Location Problems.
The University of Hong Kong, China, May 2013.