Harold N. Gabow
- Computational Theory and Mathematics top 0.1%
- Computer Networks and Communications top 0.5%
- Artificial Intelligence top 2%
- Electrical and Electronic Engineering top 5%
- Computer Graphics and Computer-Aided Design top 0.5%
- Co-authors
- Robert E. TarjanZvi GalilThomas H. SpencerJon BentleyOded KarivEugene W. MyersLeon J. OsterweilSachin Maheshwari
- Topics
- Advanced Graph Theory Research (75 papers)Complexity and Algorithms in Graphs (57 papers)Optimization and Search Problems (28 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignComputational Theory and MathematicsComputer Networks and Communications
- Partner nations
- United StatesIsraelFrance
In The Last Decade
Harold N. Gabow
114 papers receiving 4.3k citations
Peers
Comparison fields: 5 of 119
- Computational Theory and Mathematics 2.3k
- Computer Networks and Communications 1.9k
- Artificial Intelligence 813
- Electrical and Electronic Engineering 724
- Computer Graphics and Computer-Aided Design 596
Countries citing papers authored by Harold N. Gabow
This map shows the geographic impact of Harold N. Gabow'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 Harold N. Gabow with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Harold N. Gabow more than expected).
Fields of papers citing papers by Harold N. Gabow
This network shows the impact of papers produced by Harold N. Gabow. 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 Harold N. Gabow. The network helps show where Harold N. Gabow may publish in the future.
Co-authorship network of co-authors of Harold N. Gabow
This figure shows the co-authorship network connecting the top 25 collaborators of Harold N. Gabow. A scholar is included among the top collaborators of Harold N. Gabow 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 Harold N. Gabow. Harold N. Gabow 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 | 2 | |
| 3 | 10 | |
| 4 | 3 | |
| 5 | 1 | |
| 6 | 13 | |
| 7 | 95 | |
| 8 | 9 | |
| 9 | 103 | |
| 10 | 19 | |
| 11 | 4 | |
| 12 | 56 | |
| 13 | 13 | |
| 14 | 34 | |
| 15 | 228 | |
| 16 | 109 | |
| 17 | Efficient Algorithms for Graphic Intersection and Parity (Extended Abstract) | 21 |
| 18 | 33 | |
| 19 | 102 | |
| 20 | 9 |
About Harold N. Gabow
Harold N. Gabow is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 118 papers that have together received 4.7k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (75 papers), Complexity and Algorithms in Graphs (57 papers) and Optimization and Search Problems (28 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (596 citations), Computational Theory and Mathematics (2.3k citations) and Computer Networks and Communications (1.9k citations). Harold N. Gabow has collaborated with scholars based in United States, Israel and France. Frequent co-authors include Robert E. Tarjan, Zvi Galil, Thomas H. Spencer, Jon Bentley, Oded Kariv, Eugene W. Myers, Leon J. Osterweil, Sachin Maheshwari, Silvio Micali and Ying Xu. Their work appears in journals such as Bioinformatics, Communications of the ACM and IEEE Transactions on Software Engineering.
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.