Soheil Behnezhad

519 total citations
25 papers, 152 citations indexed

About

Soheil Behnezhad is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Soheil Behnezhad has authored 25 papers receiving a total of 152 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 11 papers in Computer Networks and Communications and 7 papers in Artificial Intelligence. Recurrent topics in Soheil Behnezhad's work include Complexity and Algorithms in Graphs (17 papers), Optimization and Search Problems (8 papers) and Advanced Graph Theory Research (6 papers). Soheil Behnezhad is often cited by papers focused on Complexity and Algorithms in Graphs (17 papers), Optimization and Search Problems (8 papers) and Advanced Graph Theory Research (6 papers). Soheil Behnezhad collaborates with scholars based in United States, Mexico and Switzerland. Soheil Behnezhad's co-authors include Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab Mirrokni, David G. Harris, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Silvio Lattanzi, Aviad Rubinstein, Hossein Esfandiari and Sepehr Assadi and has published in prestigious journals such as Operations Research, Journal of the ACM and Proceedings of the VLDB Endowment.

In The Last Decade

Soheil Behnezhad

25 papers receiving 148 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Soheil Behnezhad United States	8	83	63	56	43	26	25	152
Dorit Dor Israel	6	128 1.5×	95 1.5×	45 0.8×	20 0.5×	11 0.4×	10	250
Yang P. Liu United States	7	101 1.2×	49 0.8×	58 1.0×	13 0.3×	9 0.3×	20	152
Paolo Giulio Franciosa Italy	7	62 0.7×	54 0.9×	67 1.2×	38 0.9×	58 2.2×	26	162
Hamid Zarrabi-Zadeh Canada	6	42 0.5×	28 0.4×	51 0.9×	32 0.7×	26 1.0×	22	120
Aaron Bernstein United States	12	256 3.1×	95 1.5×	230 4.1×	18 0.4×	39 1.5×	32	321
Oded Lachish United Kingdom	8	112 1.3×	79 1.3×	44 0.8×	8 0.2×	9 0.3×	26	164
Sebastian Krinninger Austria	6	57 0.7×	75 1.2×	56 1.0×	93 2.2×	40 1.5×	17	175
Parinya Chalermsook Germany	7	70 0.8×	20 0.3×	53 0.9×	13 0.3×	10 0.4×	22	128
Thijs Laarhoven Netherlands	8	31 0.4×	144 2.3×	32 0.6×	119 2.8×	22 0.8×	13	236
Sanjeev Saluja India	7	73 0.9×	66 1.0×	55 1.0×	18 0.4×	60 2.3×	11	171

Countries citing papers authored by Soheil Behnezhad

Since Specialization

Citations

This map shows the geographic impact of Soheil Behnezhad's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Soheil Behnezhad with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Soheil Behnezhad more than expected).

Fields of papers citing papers by Soheil Behnezhad

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Soheil Behnezhad. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Soheil Behnezhad. The network helps show where Soheil Behnezhad may publish in the future.

Co-authorship network of co-authors of Soheil Behnezhad

This figure shows the co-authorship network connecting the top 25 collaborators of Soheil Behnezhad. A scholar is included among the top collaborators of Soheil Behnezhad based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Soheil Behnezhad. Soheil Behnezhad is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Behnezhad, Soheil, et al.. (2025). Stochastic Matching via In-n-Out Local Computation Algorithms. 1055–1066. 1 indexed citations

Behnezhad, Soheil, et al.. (2024). Approximating Maximum Matching Requires Almost Quadratic Time. 444–454. 1 indexed citations

Behnezhad, Soheil, et al.. (2024). Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs. 314–327. 1 indexed citations

Behnezhad, Soheil, et al.. (2023). Local Computation Algorithms for Maximum Matching: New Lower Bounds. 2322–2335. 1 indexed citations

Behnezhad, Soheil, MohammadTaghi Hajiaghayi, & David G. Harris. (2023). Exponentially Faster Massively Parallel Maximal Matching. Journal of the ACM. 70(5). 1–18. 2 indexed citations

Assadi, Sepehr, Soheil Behnezhad, Sanjeev Khanna, & Huan Li. (2023). On Regularity Lemma and Barriers in Streaming and Dynamic Matching. 131–144. 11 indexed citations

Behnezhad, Soheil, et al.. (2023). Sublinear Time Algorithms and Complexity of Approximate Maximum Matching. 267–280. 9 indexed citations

Behnezhad, Soheil, et al.. (2022). Almost 3-Approximate Correlation Clustering in Constant Rounds. 720–731. 4 indexed citations

Behnezhad, Soheil, et al.. (2022). Fast and Simple Solutions of Blotto Games. Operations Research. 71(2). 506–516. 3 indexed citations

10.

Behnezhad, Soheil, Mahsa Derakhshan, & MohammadTaghi Hajiaghayi. (2020). Stochastic matching with few queries: (1-ε) approximation. 1111–1124. 7 indexed citations

11.

Behnezhad, Soheil, Laxman Dhulipala, Hossein Esfandiari, et al.. (2020). Parallel graph algorithms in constant adaptive rounds. Proceedings of the VLDB Endowment. 13(13). 3588–3602. 5 indexed citations

12.

Behnezhad, Soheil, et al.. (2019). Streaming and Massively Parallel Algorithms for Edge Coloring.. European Symposium on Algorithms. 4 indexed citations

13.

Behnezhad, Soheil, Sebastian Brandt, Mahsa Derakhshan, et al.. (2019). Massively Parallel Computation of Matching and MIS in Sparse Graphs. 481–490. 16 indexed citations

14.

Behnezhad, Soheil, Mohammad Taghi Hajiaghayi, & David G. Harris. (2019). Exponentially Faster Massively Parallel Maximal Matching. 1637–1649. 15 indexed citations

15.

Behnezhad, Soheil, Laxman Dhulipala, Hossein Esfandiari, Jakub Łącki, & Vahab Mirrokni. (2019). Near-Optimal Massively Parallel Graph Connectivity. 1615–1636. 11 indexed citations

16.

Bateni, MohammadHossein, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, & Vahab Mirrokni. (2018). Brief Announcement: MapReduce Algorithms for Massive Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4. 2 indexed citations

17.

Bateni, MohammadHossein, Soheil Behnezhad, Mahsa Derakhshan, et al.. (2017). Affinity Clustering: Hierarchical Clustering at Scale. neural information processing systems. 30. 6864–6874. 33 indexed citations

18.

Behnezhad, Soheil, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, & Aleksandrs Slivkins. (2017). A Polynomial Time Algorithm for Spatio-Temporal Security Games. 697–714. 2 indexed citations

19.

Hara, Kotaro, et al.. (2017). A Pilot Deployment of an Online Tool for Large-Scale Virtual Auditing of Urban Accessibility. 305–306. 9 indexed citations

20.

Behnezhad, Soheil, et al.. (2017). Brief Announcement. 133–136. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact