World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
54
Citations
12288
World Ranking
4539
National Ranking
2128

Research.com Recognitions

  • 2002 - ACM Fellow For contributions to efficient algorithms to flows, connectivity and matching.

Overview

Harold N. Gabow is affiliated with the University of Colorado Boulder in the United States. Their research primarily focuses on the field of Computer Science, with a significant emphasis on Computational Theory and Mathematics, supported by numerous publications in this area.

Their work extensively covers subfields such as Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Computer Graphics and Computer-Aided Design, and Discrete Mathematics and Combinatorics. The main topics addressed in their research include:

  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Algorithms and Data Compression
  • Computational Geometry and Mesh Generation
  • Internet Traffic Analysis and Secure E-voting
  • Limits and Structures in Graph Theory

Harold N. Gabow has contributed to several papers published in various reputable venues:

  • Algorithms for Weighted Matching Generalizations I: Bipartite Graphs, b-matching, and Unweighted f-factors, 2021, SIAM Journal on Computing
  • A Weight-Scaling Algorithm for f-Factors of Multigraphs, 2023, Algorithmica
  • Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, 2021, SIAM Journal on Computing
  • Blocking Trails for f-factors of Multigraphs, 2023, Algorithmica
  • A Weight-scaling Algorithm for f-factors of Multigraphs, 2020, arXiv (Cornell University)

Coauthorship collaborations include work with Piotr Sankowski, with whom they have jointly published multiple papers.

Common venues for their publications include:

  • Algorithmica
  • SIAM Journal on Computing
  • arXiv (Cornell University)
  • ACM Transactions on Algorithms

Harold N. Gabow received the ACM Fellow award in 2002 for contributions to efficient algorithms concerning flows, connectivity, and matching.

Best Publications

  • A linear-time algorithm for a special case of disjoint set union

    Harold N. Gabow;Robert Endre Tarjan

  • Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

    H N Gabow;Z Galil;Z Galil;T Spencer;R E Tarjan

  • Scaling and related techniques for geometry problems

    Harold N. Gabow;Jon Louis Bentley;Robert E. Tarjan

  • Data structures for weighted matching and nearest common ancestors with linking

    Harold N. Gabow

  • Faster scaling algorithms for network problems

    H. N. Gabow;R. E. Tarjan

  • An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

    Harold N. Gabow

  • Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms

    Hal Gabow

  • Faster scaling algorithms for general graph matching problems

    Harold N. Gabow;Robert E. Tarjan

  • An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

    Harold N. Gabow

  • A matroid approach to finding edge connectivity and packing arborescences

    Harold N. Gabow

  • Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

    James R. Driscoll;Harold N. Gabow;Ruth Shrairman;Robert E. Tarjan

  • Scaling algorithms for network problems

    Harold N. Gabow

  • Forests, frames, and games: Algorithms for matroid sums and applications

    Harold N. Gabow;Herbert H. Westermann

  • Implementation of algorithms for maximum matching on nonbipartite graphs.

    Harold Neil Gabow

  • Finding All Spanning Trees of Directed and Undirected Graphs

    Harold N. Gabow;Eugene W. Myers

  • On Two Problems in the Generation of Program Test Paths

    H.N. Gabow;S.N. Maheshwari;L.J. Osterweil

  • Path-based depth-first search for strong and biconnected components

    Harold N. Gabow

  • Algorithms for two bottleneck optimization problems

    Harold N. Gabow;Robert E. Tarjan

  • An RNA folding method capable of identifying pseudoknots and base triples.

    Jack E. Tabaska;Robert B. Cary;Harold N. Gabow;Gary D. Stormo

  • Two Algorithms for Generating Weighted Spanning Trees in Order

    Harold N. Gabow

  • Data Structures for Weighted Matching and Nearest Common Ancestors with Linking ; CU-CS-478-90

    Harold N Gabow

Frequent Co-Authors

Robert E. Tarjan
Robert E. Tarjan Princeton University
Zvi Galil
Zvi Galil Georgia Institute of Technology
David P. Williamson
David P. Williamson Cornell University
Samir Khuller
Samir Khuller Northwestern University
Marek Cygan
Marek Cygan University of Warsaw
Seth Pettie
Seth Pettie University of Michigan–Ann Arbor
Fabio Somenzi
Fabio Somenzi University of Colorado Boulder
Ying Xu
Ying Xu University of Georgia

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education options can be a smart way to advance your computer science career. Today, you’ll find flexible degrees that align with your goals, schedule, and budget. Start by considering the best degrees in technology and related fields for a solid foundation in your field.

If you’re aiming for rapid career progression and need a flexible curriculum, look at the easy online masters degree programs available in computer science and IT. These programs are designed for working professionals and can often be completed in as little as 1–2 years.

For those interested in research or university-level teaching roles, pursuing an advanced doctorate can be a wise move. There are several affordable phd programs online that allow you to study while continuing your professional work.

If you're in education or leadership, fast-track your credentials with the shortest online edd programs. These accelerated Ed.D. paths help you gain senior qualifications without a lengthy on-campus commitment.

Best Scientists Citing Harold N. Gabow

Trending Scientists

Recently Published Articles