Siavosh Benabbas
- Computational Theory and Mathematics top 10%
- Computer Networks and Communications
- Artificial Intelligence
- Numerical Analysis
- Electrical and Electronic Engineering
- Topics
- Complexity and Algorithms in Graphs (5 papers)Advanced Graph Theory Research (3 papers)Computational Geometry and Mesh Generation (2 papers)
- Cited by
- Computational Theory and MathematicsNumerical AnalysisComputer Graphics and Computer-Aided Design
- Journals
- ACM Transactions on AlgorithmsTheory of ComputingDiscrete Mathematics & Theoretical Computer Science
- Partner nations
- Canada
In The Last Decade
Siavosh Benabbas
4 papers receiving 40 citations
Peers
Comparison fields: 5 of 11
- Computational Theory and Mathematics 37
- Computer Networks and Communications 18
- Artificial Intelligence 15
- Numerical Analysis 8
- Electrical and Electronic Engineering 6
Countries citing papers authored by Siavosh Benabbas
This map shows the geographic impact of Siavosh Benabbas'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 Siavosh Benabbas with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Siavosh Benabbas more than expected).
Fields of papers citing papers by Siavosh Benabbas
This network shows the impact of papers produced by Siavosh Benabbas. 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 Siavosh Benabbas. The network helps show where Siavosh Benabbas may publish in the future.
Co-authorship network of co-authors of Siavosh Benabbas
This figure shows the co-authorship network connecting the top 25 collaborators of Siavosh Benabbas. A scholar is included among the top collaborators of Siavosh Benabbas 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 Siavosh Benabbas. Siavosh Benabbas is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 13 | |
| 2 | 27 | |
| 3 | 0 | |
| 4 | 3 | |
| 5 | The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs. | 1 |
About Siavosh Benabbas
Siavosh Benabbas is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Numerical Analysis, having authored 5 papers that have together received 44 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (5 papers), Advanced Graph Theory Research (3 papers) and Computational Geometry and Mesh Generation (2 papers). The work is most often cited by research in Computational Theory and Mathematics (37 citations), Numerical Analysis (8 citations) and Computer Graphics and Computer-Aided Design (3 citations). Siavosh Benabbas has collaborated with scholars based in Canada. Frequent co-authors include Avner Magen, Madhur Tulsiani, Konstantinos Georgiou, Konstantinos Georgiou, Per Austrin and Siu On Chan. Their work appears in journals such as ACM Transactions on Algorithms, Theory of Computing and Discrete Mathematics & Theoretical Computer Science.
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.