Peyman Jabbarzade

According to our database, Peyman Jabbarzade authored at least 12 papers between 2022 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Non-monotone Submodular Optimization: <i>p</i>-Matchoid Constraints and Fully Dynamic Setting.

Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond.

Kiarash Banihashem, Jeff Giliberti, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2025, 2025

Prize-Collecting Forest with Submodular Penalties: Improved Approximation.

Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

Dynamic Algorithms for Submodular Matching.

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Breaking a Long-Standing Barrier: 2-ε Approximation for Steiner Forest.

Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024

Prize-Collecting Steiner Tree: A 1.79 Approximation.

Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Dynamic Algorithms for Matroid Submodular Maximization.

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2-Approximation for Prize-Collecting Steiner Forest.

Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Mohammad Mahdavi

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Dynamic Algorithm for Weighted Submodular Cover Problem.

Kiarash Banihashem, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the Forty-first International Conference on Machine Learning, 2024

2023

Dynamic Non-monotone Submodular Maximization.

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time.

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, Morteza Monemizadeh

Proceedings of the International Conference on Machine Learning, 2023

2022

A Novel Prediction Setup for Online Speed-Scaling.

Antonios Antoniadis, Peyman Jabbarzade, Golnoosh Shahkarami

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022