default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSoheil Behnezhad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c40]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. ICALP 2024: 19:1-19:16- [c39]Mohammad Saneian, Soheil Behnezhad:
Streaming Edge Coloring with Asymptotically Optimal Colors. ICALP 2024: 121:1-121:20 - [c38]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. ICML 2024 - [c37]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Fully Dynamic Matching: -Approximation in Polylog Update Time. SODA 2024: 3040-3061 - [c36]Soheil Behnezhad
, Mohammad Roghani, Aviad Rubinstein:
Approximating Maximum Matching Requires Almost Quadratic Time. STOC 2024: 444-454 - [i37]Soheil Behnezhad, Alma Ghafari:
Fully Dynamic Matching and Ordered Ruzsa-Szemer\'edi Graphs. CoRR abs/2404.06069 (2024) - [i36]Soheil Behnezhad, Moses Charikar, Vincent Cohen-Addad, Alma Ghafari, Weiyun Ma:
Fully Dynamic Correlation Clustering: Breaking 3-Approximation. CoRR abs/2404.06797 (2024) - [i35]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS. CoRR abs/2406.07630 (2024) - [i34]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Approximating Maximum Matching Requires Almost Quadratic Time. CoRR abs/2406.08595 (2024) - [i33]Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan:
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. CoRR abs/2407.21005 (2024) - [i32]Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong:
Massively Parallel Minimum Spanning Tree in General Metric Spaces. CoRR abs/2408.06455 (2024) - 2023
- [j4]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Fast and Simple Solutions of Blotto Games. Oper. Res. 71(2): 506-516 (2023) - [j3]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. J. ACM 70(5): 34:1-34:18 (2023) - [c35]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Local Computation Algorithms for Maximum Matching: New Lower Bounds. FOCS 2023: 2322-2335 - [c34]Amir Azarmehr, Soheil Behnezhad:
Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. ICALP 2023: 14:1-14:15 - [c33]Soheil Behnezhad:
Dynamic Algorithms for Maximum Matching Size. SODA 2023: 129-162 - [c32]Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan:
Single-Pass Streaming Algorithms for Correlation Clustering. SODA 2023: 819-849 - [c31]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Beating Greedy Matching in Sublinear Time. SODA 2023: 3900-3945 - [c30]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC 2023: 131-144 - [c29]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. STOC 2023: 267-280 - [i31]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Sublinear Algorithms for TSP via Path Covers. CoRR abs/2301.05350 (2023) - [i30]Amir Azarmehr, Soheil Behnezhad:
Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation. CoRR abs/2305.01070 (2023) - [i29]Soheil Behnezhad, Mohammad Saneian:
Streaming Edge Coloring with Asymptotically Optimal Colors. CoRR abs/2305.01714 (2023) - [i28]Amir Azarmehr, Soheil Behnezhad, Mohammad Roghani:
Fully Dynamic Matching: (2-√2)-Approximation in Polylog Update Time. CoRR abs/2307.08772 (2023) - [i27]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Local Computation Algorithms for Maximum Matching: New Lower Bounds. CoRR abs/2311.09359 (2023) - 2022
- [c28]Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan:
Almost 3-Approximate Correlation Clustering in Constant Rounds. FOCS 2022: 720-731 - [c27]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan:
Stochastic Vertex Cover with Few Queries. SODA 2022: 1808-1846 - [c26]Soheil Behnezhad, Sanjeev Khanna:
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. SODA 2022: 3529-3566 - [i26]Soheil Behnezhad, Sanjeev Khanna:
New Trade-Offs for Fully Dynamic Matching via Hierarchical EDCS. CoRR abs/2201.02905 (2022) - [i25]Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan:
Almost 3-Approximate Correlation Clustering in Constant Rounds. CoRR abs/2205.03710 (2022) - [i24]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein, Amin Saberi:
Beating Greedy Matching in Sublinear Time. CoRR abs/2206.13057 (2022) - [i23]Soheil Behnezhad:
Dynamic Algorithms for Maximum Matching Size. CoRR abs/2207.07607 (2022) - [i22]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR abs/2207.09354 (2022) - [i21]Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein:
Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. CoRR abs/2211.15843 (2022) - 2021
- [b1]Soheil Behnezhad:
Modern Large-Scale Algorithms for Classical Graph Problems. University of Maryland, College Park, MD, USA, 2021 - [j2]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. ACM Trans. Parallel Comput. 8(3): 13:1-13:25 (2021) - [c25]Sepehr Assadi, Soheil Behnezhad:
On the Robust Communication Complexity of Bipartite Matching. APPROX-RANDOM 2021: 48:1-48:17 - [c24]Soheil Behnezhad:
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. FOCS 2021: 873-884 - [c23]Sepehr Assadi, Soheil Behnezhad:
Beating Two-Thirds For Random-Order Streaming Matching. ICALP 2021: 19:1-19:13 - [i20]Sepehr Assadi, Soheil Behnezhad:
Beating Two-Thirds For Random-Order Streaming Matching. CoRR abs/2102.07011 (2021) - [i19]Soheil Behnezhad:
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. CoRR abs/2106.02942 (2021) - [i18]Soheil Behnezhad:
Improved Analysis of EDCS via Gallai-Edmonds Decomposition. CoRR abs/2110.05746 (2021) - [i17]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan:
Stochastic Vertex Cover with Few Queries. CoRR abs/2112.05415 (2021) - 2020
- [j1]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. Proc. VLDB Endow. 13(13): 3588-3602 (2020) - [c22]Soheil Behnezhad, Mahsa Derakhshan:
Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation. FOCS 2020: 1392-1403 - [c21]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δϵ Update Time. SODA 2020: 2492-2508 - [c20]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic matching with few queries: (1-ε) approximation. STOC 2020: 1111-1124 - [i16]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR abs/2002.11880 (2020) - [i15]Soheil Behnezhad, Mahsa Derakhshan:
Stochastic Weighted Matching: $(1-ε)$ Approximation. CoRR abs/2004.08703 (2020) - [i14]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice. CoRR abs/2009.11552 (2020)
2010 – 2019
- 2019
- [c19]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. EC 2019: 597-616 - [c18]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA 2019: 15:1-15:14 - [c17]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - [c16]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. FOCS 2019: 1615-1636 - [c15]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. FOCS 2019: 1637-1649 - [c14]Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto:
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC 2019: 481-490 - [c13]Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching on Uniformly Sparse Graphs. SAGT 2019: 357-373 - [c12]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. SODA 2019: 2855-2874 - [c11]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni, Warren Schudy:
Massively Parallel Computation via Remote Memory Access. SPAA 2019: 59-68 - [c10]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC 2019: 36:1-36:3 - [i13]Soheil Behnezhad, MohammadTaghi Hajiaghayi, David G. Harris:
Exponentially Faster Massively Parallel Maximal Matching. CoRR abs/1901.03744 (2019) - [i12]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. CoRR abs/1901.04153 (2019) - [i11]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Warren Schudy, Vahab S. Mirrokni:
Massively Parallel Computation via Remote Memory Access. CoRR abs/1905.07533 (2019) - [i10]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR abs/1909.03478 (2019) - [i9]Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab S. Mirrokni:
Near-Optimal Massively Parallel Graph Connectivity. CoRR abs/1910.05385 (2019) - [i8]Soheil Behnezhad, Jakub Lacki, Vahab S. Mirrokni:
Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time. CoRR abs/1911.01839 (2019) - 2018
- [c9]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - [c8]Soheil Behnezhad, Nima Reyhani:
Almost Optimal Stochastic Weighted Matching with Few Queries. EC 2018: 235-249 - [c7]Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Spatio-Temporal Games Beyond One Dimension. EC 2018: 411-428 - [c6]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark:
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA 2018: 2291-2310 - [i7]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Brief Announcement: Semi-MapReduce Meets Congested Clique. CoRR abs/1802.10297 (2018) - [i6]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Richard M. Karp:
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. CoRR abs/1807.06701 (2018) - [i5]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Massively Parallel Dynamic Programming on Trees. CoRR abs/1809.03685 (2018) - [i4]Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching with Few Queries: New Algorithms and Tools. CoRR abs/1811.03224 (2018) - 2017
- [c5]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. AAAI 2017: 369-375 - [c4]Manaswi Saha, Kotaro Hara, Soheil Behnezhad, Anthony Li, Michael Saugstad, Hanuma Teja Maddali, Sage Chen, Jon E. Froehlich:
A Pilot Deployment of an Online Tool for Large-Scale Virtual Auditing of Urban Accessibility. ASSETS 2017: 305-306 - [c3]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni:
Affinity Clustering: Hierarchical Clustering at Scale. NIPS 2017: 6864-6874 - [c2]Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Aleksandrs Slivkins:
A Polynomial Time Algorithm for Spatio-Temporal Security Games. EC 2017: 697-714 - [c1]Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami:
Brief Announcement: Graph Matching in Massive Datasets. SPAA 2017: 133-136 - [i3]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Aleksandrs Slivkins:
A Polynomial Time Algorithm for Spatio-Temporal Security Games. CoRR abs/1706.05711 (2017) - [i2]Soheil Behnezhad, Nima Reyhani:
Almost Optimal Stochastic Weighted Matching With Few Queries. CoRR abs/1710.10592 (2017) - 2016
- [i1]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. CoRR abs/1612.04029 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-25 00:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
