Harold N. Gabow
Harold N. Gabow is a computer scientist known for research on combinatorial algorithms, graph algorithms and data structures. He is a Professor Emeritus at the University of Colorado Boulder, and founding Editor-in-Chief of ACM Transactions on Algorithms.
Education and career
Gabow graduated from Martin Van Buren High School, where he was mentored by Ira Ewen. He graduated summa cum laude from Harvard University in 1968, with a bachelor's degree in mathematics. 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. Stone.After working as an instructor at the University of Pennsylvania for a year, he joined the University of Colorado Boulder faculty in 1973 as an Assistant Professor of Computer Science, becoming Associate Professor in 1979, Full Professor in 1986, Professor Emeritus in 2008.
Gabow was the founding Editor-in-Chief of ACM Transactions on Algorithms, which published its first issue in 2005, after the mass resignation of the editorial board of its predecessor, Elsevier's Journal of Algorithms. He stepped down as Editor-in-Chief on his retirement in 2008.
Selected publications
``A linear-time algorithm for a special case of disjoint set union,``Scaling algorithms for network problems,
``Faster scaling algorithms for general graph matching problems,
``A matroid approach to finding edge connectivity and packing arborescences,
``Path-based depth-first search for strong and biconnected components,
"The weighted matching approach to maximum cardinality matching," H.N. Gabow, Fundamenta Informaticae ,