A Novel Prediction Setup for Online Speed-Scaling. - Antonios Antoniadis 001; Peyman Jabbarzade; Golnoosh Shahkarami (SWAT, 2022)

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (ICML, 2023)

Dynamic Non-monotone Submodular Maximization. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (NeurIPS, 2023)

A Dynamic Algorithm for Weighted Submodular Cover Problem. - Kiarash Banihashem; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (ICML, 2024)

Dynamic Algorithms for Matroid Submodular Maximization. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (SODA, 2024)

Prize-Collecting Steiner Tree: A 1.79 Approximation. - Ali Ahmadi; Iman Gholami; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Mohammad Mahdavi (STOC, 2024)

Dynamic Algorithms for Submodular Matching. - Kiarash Banihashem; Leyla Biabani; Samira Goudarzi; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Morteza Monemizadeh (ICALP, 2025)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation. - Ali Ahmadi; Iman Gholami; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Mohammad Mahdavi (IPCO, 2025)

Breaking a Long-Standing Barrier: 2-ϵ Approximation for Steiner Forest. - Ali Ahmadi; Iman Gholami; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Mohammad Mahdavi (CoRR, 2025)

2-Approximation for Prize-Collecting Steiner Forest. - Ali Ahmadi; Iman Gholami; MohammadTaghi Hajiaghayi; Peyman Jabbarzade; Mohammad Mahdavi (J. ACM, 2025)