Hal Gabow

         Professor Emeritus

• Email: hal at cs dot colorado dot edu
• Vita

• 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)
    • A combinatoric interpretation of dual variables for weighted matching problems , 37 pages.
    • 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, SIAM J. Comput. 41, 2012, pp.61-103.
  • Older papers

• Teaching.
  • Path-based depth first search    (Why path-based dfs?)
  • More on Teaching

• Service. (not much in retirement)
  • SIGACT Distinguished Service Award Committee. 2013 Call for nominations.
  • TALG history.
  • My SODA 2007 Program Committee report (the stats are old but the lessons learned are timeless)

• Personal.
  • A list of my favorite things.
  • Some pics

  Home - Return to CS Dept Home Page

  ---