About Me
I’m a third-year Ph.D. student at the University of Maryland, College Park, under the supervision of Prof. Hajiaghayi. I earned my Bachelor’s and Master’s degrees in Computer Engineering from Sharif University of Technology, where I was advised by Prof. Abam.
I am currently a member of the Theoretical Computer Science group at UMD, where my research interests primarily focus on designing algorithms, particularly for complex graph theory problems. My favorite project revolves around the design of an algorithm for the prize-collecting Steiner forest problem. Additionally, I am interested in optimizing submodular functions, which have wide applications in machine learning.
Research Interests
- Optimization: submodular maximization, scheduling
- Algorithmic Graph Theory: steiner tree, steiner forest, k-mst
News
- [Aug 2024] I am going to defend my proposal to advance to Ph.D. candidacy.
- [Jun 2024] Our paper on a dynamic algorithm for weighted submodular cover has been accepted for an oral presentation at ICML 2024 in Vienna, Austria.
- [Jan 2024] I gave a presentation on our paper about the 2-approximation algorithm for the prize-collecting Steiner forest at SODA 2024 in Alexandria, US.
- [Dec 2023] I presented a poster on dynamic matroid submodular maximization at NeurIPS 2023 in New Orleans, US.
Publications
-
A Dynamic Algorithm for Weighted Submodular Cover Problem
Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
41th International Conference on Machine Learning. ICML 2024. Oral Presentation
[PDF] - Prize-Collecting Steiner Tree: A 1.79 Approximation
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi
56th ACM Symposium on Theory of Computing. STOC 2024. -
[PDF]
-
2-Approximation for Prize-Collecting Steiner Forest
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi
ACM-SIAM Symposium on Discrete Algorithms. SODA 2024. Selected for Special Issue
[PDF] [Slides] -
Dynamic Algorithms for Matroid Submodular Maximization
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
ACM-SIAM Symposium on Discrete Algorithms. SODA 2024.
[PDF] -
Dynamic Non-monotone Submodular Maximization
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
37th Conference on Neural Information Processing Systems. NeurIPS 2023.
[PDF] [Code] [Poster] -
Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time
Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh
40th International Conference on Machine Learning. ICML 2023.
[PDF] [Poster] - A Novel Prediction Setup for Online Speed-Scaling
Antonios Antoniadis, Peyman Jabbarzade Ganje, Golnoosh Shahkarami
18th Scandinavian Symposium and Workshops on Algorithm Theory. SWAT 2022.
[PDF]
Awards
- Asia west champion in International Collegiate Programming Contest (ICPC) world final contest, 2018.
- 14th place in International Collegiate Programming Contest (ICPC) world final contest, 2016.
- Champions in International Collegiate Programming Contest (ICPC) Tehran regional contest, 2015 and 2016.
- Bronze medal in International Olympiad in Informatics (IOI), 2015.
- Gold medal in Asia-Pacific Informatics Olympiad (APIO), 2015.
- Gold medal in Iranian National Olympiad in Informatics (IOI), 2014.