Research.
My research is in the design and analysis of algorithms (especially
graph algorithms), combinatorial optimization and linear programming.
Most recent papers (send email for a copy)
Minimizing processor activation time and triangle-free 2-matchings,
J.Chang, H.Gabow and S.Khuller, 27 pages.
The minset poset is well-known. We show it
gives the cactus representation and the dominator tree:
The minimal-set poset for edge connectivity,
H.N.Gabow, 44 pages.
A poset approach to dominator computation,
H.N.Gabow, 15 pages.
Iterated rounding algorithms for the smallest $k$-edge connected spanning subgraph,
H.N.Gabow and S.Gallagher, 45 pages, complete version of SODA '08 paper.
