Soheil Behnezhad
- Computational Theory and Mathematics top 5%
- Artificial Intelligence
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Signal Processing
- Co-authors
- Mahsa DerakhshanMohammadTaghi HajiaghayiVahab MirrokniDavid G. HarrisMohammadHossein BateniSilvio LattanziMohammad Taghi HajiaghayiHossein Esfandiari
- Topics
- Complexity and Algorithms in Graphs (17 papers)Optimization and Search Problems (8 papers)Advanced Graph Theory Research (6 papers)
- Cited by
- Computational Theory and MathematicsComputer Graphics and Computer-Aided DesignComputer Networks and Communications
- Partner nations
- United StatesMexicoSwitzerland
In The Last Decade
Soheil Behnezhad
25 papers receiving 148 citations
Peers
Comparison fields: 5 of 44
- Computational Theory and Mathematics 83
- Artificial Intelligence 63
- Computer Networks and Communications 56
- Computer Vision and Pattern Recognition 43
- Signal Processing 26
Countries citing papers authored by Soheil Behnezhad
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 2 | |
| 5 | 1 | |
| 6 | 11 | |
| 7 | 9 | |
| 8 | 3 | |
| 9 | 4 | |
| 10 | 7 | |
| 11 | 5 | |
| 12 | 4 | |
| 13 | Streaming and Massively Parallel Algorithms for Edge Coloring. | 4 |
| 14 | 15 | |
| 15 | 16 | |
| 16 | 3 | |
| 17 | 2 | |
| 18 | Affinity Clustering: Hierarchical Clustering at Scale | 33 |
| 19 | 2 | |
| 20 | 9 |
About Soheil Behnezhad
Soheil Behnezhad is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Signal Processing, having authored 25 papers that have together received 152 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (17 papers), Optimization and Search Problems (8 papers) and Advanced Graph Theory Research (6 papers). The work is most often cited by research in Computational Theory and Mathematics (83 citations), Computer Graphics and Computer-Aided Design (15 citations) and Computer Networks and Communications (56 citations). Soheil Behnezhad has collaborated with scholars based in United States, Mexico and Switzerland. Frequent co-authors include Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab Mirrokni, David G. Harris, MohammadHossein Bateni, Silvio Lattanzi, Mohammad Taghi Hajiaghayi, Hossein Esfandiari, Aviad Rubinstein and Huan Li. Their work appears in journals such as Operations Research, Journal of the ACM and Proceedings of the VLDB Endowment.
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.