Harold N. Gabow is an American computer scientist known for his research on graph algorithms and data structures.
He is a professor emeritus at the University of Colorado Boulder, and the former founding editor-in-chief of ACM Transactions on Algorithms.
Gabow graduated summa cum laude from Harvard University in 1968, with a bachelor's degree in mathematics.
[1] He completed his Ph.D. in computer science in 1973 at Stanford University; his dissertation, Implementations of algorithms for maximum matching on nonbipartite graphs, was supervised by Harold S.
[1] Gabow was named as an ACM Fellow in 2002, "for contributions to efficient algorithms to flows, connectivity and matching".