Science Explorer Interactive view Map
Researcher · University of Colorado Boulder · United States

Harold N. Gabow

Harold N. Gabow publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, on topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research and Optimization and Search Problems.

ORCID 0000-0002-9775-3492 OpenAlex
World rank
#30,245
of 1,633,909 ranked researchers
Rank in United States
#14,107
of 358,040
Works
55
Citations
681
Citations per work
12.4

What does Harold N. Gabow research?

Computational Theory and Mathematics: 52.6%Computer Networks and Communications: 13.2%Artificial Intelligence: 6.6%Computer Graphics and Computer-Aided Design: 5.3%other fields: 22.3%53%top field
Computational Theory and Mathematics52.6%Computer Networks and Communications13.2%Artificial Intelligence6.6%Computer Graphics and Computer-Aided Design5.3%other fields22.3%

Shares of their own output, by the field each of their topics belongs to. The grey slice is everything not listed.

  1. 1Computational Theory and Mathematics53% of their works
  2. 2Computer Networks and Communications13% of their works
  3. 3Artificial Intelligence7% of their works
  4. 4Computer Graphics and Computer-Aided Design5% of their works
  5. 5Computer Vision and Pattern Recognition5% of their works
  6. 6Hardware and Architecture3% of their works

Research topics

Which keywords describe Harold N. Gabow's research?

The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Combinatorial Optimization, Complexity Theory, Graph Theory, Parameterized Complexity, Mobile Robots and Online Algorithms.

Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most.

All 18 words, with their numbers
  1. Approximation Algorithms403 topics
  2. Algorithmic Applications362 topics
  3. Combinatorial Optimization191 topic
  4. Complexity Theory191 topic
  5. Graph Theory171 topic
  6. Parameterized Complexity171 topic
  7. Mobile Robots71 topic
  8. Online Algorithms71 topic
  9. Delaunay Triangulations41 topic
  10. Graph Matching41 topic
  11. Graph Processing41 topic
  12. Mesh Generation41 topic
  13. Compression31 topic
  14. Suffix Arrays31 topic
  15. Deep Packet Inspection21 topic
  16. Graph Labeling21 topic
  17. Metric Dimension21 topic
  18. Packet Classification21 topic

Where does Harold N. Gabow work?

Harold N. Gabow's main affiliation in the publication record is University of Colorado Boulder, United States.

How many publications and citations does Harold N. Gabow have?

Science Explorer counts 55 works and 681 citations for Harold N. Gabow, ranking #30,245 of 1,633,909 researchers worldwide on the composite score.

Ranked on field-normalised excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.

Papers, co-authors, who cited this work and researchers on the nearest topics are in the interactive view on the map. Is this your page? Request a correction or removal.