Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (AAAI, 2017)

A Pilot Deployment of an Online Tool for Large-Scale Virtual Auditing of Urban Accessibility. - Manaswi Saha; Kotaro Hara; Soheil Behnezhad; Anthony Li; Michael Saugstad; Hanuma Teja Maddali; Sage Chen; Jon E. Froehlich (ASSETS, 2017)

Affinity Clustering: Hierarchical Clustering at Scale. - MohammadHossein Bateni; Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Raimondas Kiveris; Silvio Lattanzi; Vahab S. Mirrokni (NIPS, 2017)

A Polynomial Time Algorithm for Spatio-Temporal Security Games. - Soheil Behnezhad; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Aleksandrs Slivkins (EC, 2017)

Brief Announcement: Graph Matching in Massive Datasets. - Soheil Behnezhad; Mahsa Derakhshan; Hossein Esfandiari; Elif Tan; Hadi Yami (SPAA, 2017)

Brief Announcement: MapReduce Algorithms for Massive Trees. - MohammadHossein Bateni; Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Vahab S. Mirrokni (ICALP, 2018)

Spatio-Temporal Games Beyond One Dimension. - Soheil Behnezhad; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Saeed Seddighin (EC, 2018)

Almost Optimal Stochastic Weighted Matching with Few Queries. - Soheil Behnezhad; Nima Reyhani (EC, 2018)

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Mohammad Mahdian; Christos H. Papadimitriou; Ronald L. Rivest; Saeed Seddighin; Philip B. Stark (SODA, 2018)

Brief Announcement: Semi-MapReduce Meets Congested Clique. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi (CoRR, 2018)

Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Richard M. Karp (CoRR, 2018)

Massively Parallel Dynamic Programming on Trees. - MohammadHossein Bateni; Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Vahab S. Mirrokni (CoRR, 2018)

Optimal Strategies of Blotto Games: Beyond Convexity. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan; Mohammad Taghi Hajiaghayi; Christos H. Papadimitriou; Saeed Seddighin (EC, 2019)

Streaming and Massively Parallel Algorithms for Edge Coloring. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh (ESA, 2019)

Near-Optimal Massively Parallel Graph Connectivity. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni (FOCS, 2019)

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Cliff Stein 001; Madhu Sudan 001 (FOCS, 2019)

Massively Parallel Computation of Matching and MIS in Sparse Graphs. - Soheil Behnezhad; Sebastian Brandt 002; Mahsa Derakhshan; Manuela Fischer; MohammadTaghi Hajiaghayi; Richard M. Karp; Jara Uitto (PODC, 2019)

Stochastic Matching on Uniformly Sparse Graphs. - Soheil Behnezhad; Mahsa Derakhshan; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Nima Reyhani (SAGT, 2019)

Stochastic Matching with Few Queries: New Algorithms and Tools. - Soheil Behnezhad; Alireza Farhadi 001; MohammadTaghi Hajiaghayi; Nima Reyhani (SODA, 2019)

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Marina Knittel; Hamed Saleh (DISC, 2019)

Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time. - Soheil Behnezhad; Jakub Lacki; Vahab S. Mirrokni (CoRR, 2019)

Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation - varepsilon$) Approximation. - Soheil Behnezhad; Mahsa Derakhshan (FOCS, 2020)

Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. - Soheil Behnezhad; Jakub Lacki; Vahab S. Mirrokni (SODA, 2020)

Stochastic matching with few queries: (1-ε) approximation. - Soheil Behnezhad; Mahsa Derakhshan; MohammadTaghi Hajiaghayi (STOC, 2020)

Stochastic Weighted Matching: $(1-ε)$ Approximation. - Soheil Behnezhad; Mahsa Derakhshan (CoRR, 2020)

Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni; Warren Schudy (Proc. VLDB Endow., 2020)

On the Robust Communication Complexity of Bipartite Matching. - Sepehr Assadi; Soheil Behnezhad (APPROX-RANDOM, 2021)

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. - Soheil Behnezhad (FOCS, 2021)

Beating Two-Thirds For Random-Order Streaming Matching. - Sepehr Assadi; Soheil Behnezhad (ICALP, 2021)

Improved Analysis of EDCS via Gallai-Edmonds Decomposition. - Soheil Behnezhad (CoRR, 2021)

Massively Parallel Computation via Remote Memory Access. - Soheil Behnezhad; Laxman Dhulipala; Hossein Esfandiari; Jakub Lacki; Vahab S. Mirrokni; Warren Schudy (ACM Trans. Parallel Comput., 2021)

Modern Large-Scale Algorithms for Classical Graph Problems. - Soheil Behnezhad (2021)

Almost 3-Approximate Correlation Clustering in Constant Rounds. - Soheil Behnezhad; Moses Charikar; Weiyun Ma; Li-Yang Tan (FOCS, 2022)

Stochastic Vertex Cover with Few Queries. - Soheil Behnezhad; Avrim Blum; Mahsa Derakhshan (SODA, 2022)

New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. - Soheil Behnezhad; Sanjeev Khanna (SODA, 2022)

Local Computation Algorithms for Maximum Matching: New Lower Bounds. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein (FOCS, 2023)

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

Dynamic Algorithms for Maximum Matching Size. - Soheil Behnezhad (SODA, 2023)

Single-Pass Streaming Algorithms for Correlation Clustering. - Soheil Behnezhad; Moses Charikar; Weiyun Ma; Li-Yang Tan (SODA, 2023)

Beating Greedy Matching in Sublinear Time. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein; Amin Saberi (SODA, 2023)

On Regularity Lemma and Barriers in Streaming and Dynamic Matching. - Sepehr Assadi; Soheil Behnezhad; Sanjeev Khanna; Huan Li 002 (STOC, 2023)

Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein (STOC, 2023)

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

Fast and Simple Solutions of Blotto Games. - Soheil Behnezhad; Sina Dehghani; Mahsa Derakhshan; MohammadTaghi Hajiaghayi; Saeed Seddighin (Oper. Res., 2023)

Exponentially Faster Massively Parallel Maximal Matching. - Soheil Behnezhad; MohammadTaghi Hajiaghayi; David G. Harris 001 (J. ACM, 2023)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs. - Soheil Behnezhad; Alma Ghafari (FOCS, 2024)

Sublinear Algorithms for TSP via Path Covers. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein; Amin Saberi (ICALP, 2024)

Streaming Edge Coloring with Asymptotically Optimal Colors. - Mohammad Saneian; Soheil Behnezhad (ICALP, 2024)

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)

Approximating Maximum Matching Requires Almost Quadratic Time. - Soheil Behnezhad; Mohammad Roghani; Aviad Rubinstein (STOC, 2024)

Fully Dynamic Matching and Ordered Ruzsa-Szemer 'edi Graphs. - Soheil Behnezhad; Alma Ghafari (CoRR, 2024)

Fully Dynamic Correlation Clustering: Breaking 3-Approximation. - Soheil Behnezhad; Moses Charikar; Vincent Cohen-Addad; Alma Ghafari; Weiyun Ma (CoRR, 2024)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. - Sepehr Assadi; Soheil Behnezhad; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (SODA, 2025)

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

Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries. - Soheil Behnezhad; Rajmohan Rajaraman; Omer Wasim (SODA, 2025)

Vizing's Theorem in Near-Linear Time. - Sepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martín Costa; Shay Solomon; Tianyi Zhang 008 (STOC, 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)