| 2026 | STOC | Half-Approximating Maximum Dicut in the Streaming Setting. | Amir Azarmehr, Soheil Behnezhad, Shane Ferrante, Mohammad Saneian |
| 2025 | FOCS | Lower Bounds for Non-adaptive Local Computation Algorithms. | Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan |
| 2025 | FOCS | Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance. | Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein |
| 2025 | SODA | Massively Parallel Minimum Spanning Tree in General Metric Spaces. | Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong |
| 2025 | STOC | Stochastic Matching via In-n-Out Local Computation Algorithms. | Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Ronitt Rubinfeld |
| 2024 | ICML | Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. | Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani |
| 2024 | SODA | Fully Dynamic Matching: -Approximation in Polylog Update Time. | Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani |
| 2023 | ICALP | Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. | Amir Azarmehr, Soheil Behnezhad |