Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. - Amir Azarmehr; Soheil Behnezhad (ICALP, 2023)

Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time. - Amir Azarmehr; Soheil Behnezhad; Mohammad Roghani (CoRR, 2023)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. - Amir Azarmehr; Soheil Behnezhad; Mohammad Roghani (ICML, 2024)

Fully Dynamic Matching: -Approximation in Polylog Update Time. - Amir Azarmehr; Soheil Behnezhad; Mohammad Roghani (SODA, 2024)

Massively Parallel Minimum Spanning Tree in General Metric Spaces. - Amir Azarmehr; Soheil Behnezhad; Rajesh Jayaram; Jakub Lacki; Vahab Mirrokni; Peilin Zhong (SODA, 2025)

Stochastic Matching via In-n-Out Local Computation Algorithms. - Amir Azarmehr; Soheil Behnezhad; Alma Ghafari; Ronitt Rubinfeld (STOC, 2025)

Lower Bounds for Non-adaptive Local Computation Algorithms. - Amir Azarmehr; Soheil Behnezhad; Alma Ghafari; Madhu Sudan 001 (CoRR, 2025)