Amir Abboud
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
-
- Computational Geometry and Mesh Generation
Papers in
-
- Complexity and Algorithms in Graphs 30
- Advanced Graph Theory Research 22
-
- Algorithms and Data Compression 11
- Machine Learning and Algorithms 5
- Co-authors
- Virginia Vassilevska Williams (12 shared papers)Huacheng Yu (4 shared papers)Artūrs Bačkurs (4 shared papers)Ryan Williams (3 shared papers)Karl Bringmann (4 shared papers)Fabrizio Grandoni (3 shared papers)Thomas Dueholm Hansen (3 shared papers)Seth Pettie (2 shared papers)
- Journals
- ACM Transactions on Algorithms (3 papers)SIAM Journal on Computing (2 papers)Journal of the ACM (1 paper)IEEE Transactions on Knowledge and Data Engineering (1 paper)Theory of Computing (1 paper)
- Partner nations
- United StatesIsraelSwitzerland
In The Last Decade
Amir Abboud
37 papers receiving 543 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 402
- Computer Graphics and Computer-Aided Design 55
- Discrete Mathematics and Combinatorics 32
- Computer Networks and Communications 215
- Hardware and Architecture 52
Countries citing papers authored by Amir Abboud
This map shows the geographic impact of Amir Abboud'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 Amir Abboud with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amir Abboud more than expected).
Fields of papers citing papers by Amir Abboud
This network shows the impact of papers produced by Amir Abboud. 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 Amir Abboud. The network helps show where Amir Abboud may publish in the future.
Co-authors
The 25 scholars most cited alongside Amir Abboud, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 39 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2014 | 115 | |
| 2 | 2015 | 53 | |
| 3 | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter | 2015 | 29 |
| 4 | More applications of the polynomial method to algorithm design | 2015 | 29 |
| 5 | 2016 | 29 | |
| 6 | 2015 | 29 | |
| 7 | 2016 | 27 | |
| 8 | 2014 | 25 | |
| 9 | 2014 | 19 | |
| 10 | 2015 | 18 | |
| 11 | 2014 | 17 | |
| 12 | 2018 | 15 | |
| 13 | 2017 | 14 | |
| 14 | 2022 | 13 | |
| 15 | 2019 | 11 | |
| 16 | 2022 | 10 | |
| 17 | 2018 | 10 | |
| 18 | 2019 | 10 | |
| 19 | 2019 | 9 | |
| 20 | 2023 | 9 |
About Amir Abboud
Amir Abboud is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition and Signal Processing, having authored 39 papers that have together received 571 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (30 papers), Advanced Graph Theory Research (22 papers), Algorithms and Data Compression (11 papers), Optimization and Search Problems (9 papers), Machine Learning and Algorithms (5 papers), Graph Theory and Algorithms (4 papers), Data Management and Algorithms (4 papers) and Computational Geometry and Mesh Generation (4 papers). The work is most often cited by research in Computational Theory and Mathematics (402 citations), Computer Graphics and Computer-Aided Design (55 citations), Discrete Mathematics and Combinatorics (32 citations), Computer Networks and Communications (215 citations) and Hardware and Architecture (52 citations). Amir Abboud has collaborated with scholars based in United States, Israel and Switzerland. Frequent co-authors include Virginia Vassilevska Williams, Huacheng Yu, Artūrs Bačkurs, Ryan Williams, Karl Bringmann, Fabrizio Grandoni, Thomas Dueholm Hansen, Seth Pettie, Robert Krauthgamer and Debmalya Panigrahi. Their work appears in journals such as ACM Transactions on Algorithms, SIAM Journal on Computing, Journal of the ACM, IEEE Transactions on Knowledge and Data Engineering and Theory of Computing.
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.