skip to main content
Department of Computer Science University of Colorado Boulder
cu: home | engineering | mycuinfo | about | cu a-z | search cu | contact cu cs: about | calendar | directory | catalog | schedules | mobile | contact cs
home · the department · publications · theses · 

PhD Theses Advised by Harold (Hal) Gabow

by Year by Author by Advisor
 Warmuth, Manfred Klaus
PhD 1981
Scheduling on profiles of constant breadth
 Stallmann, Matthias Friedemann Martin
PhD 1982
An augmenting paths algorithm for the matroid party problem on binary matroids
 Westermann, Herbert Hans
PhD 1988
Efficient algorithms for matroid sums
 Xu, Ying
PhD 1991
Efficient sequential and parallel matroid intersection algorithms
 Shrairman, Ruth
PhD 1995
R2-heaps with suspended relaxation for manipulating priority queues and: a new algorithm for reweighting graphs
 Skulrattanakulchai, San
PhD 2002
Efficient algorithms for graph coloring: vertex, edge, list, total, and acyclic coloring
 Nie, Shuxin
PhD 2008
Algorithms on long paths and cycles in graphs
 Gallagher, Suzanne Renick
PhD 2010
Graph connectivity: approximation algorithms and applications to protein-protein interaction networks
See also:
Department of Computer Science
College of Engineering and Applied Science
University of Colorado Boulder
Boulder, CO 80309-0430 USA
Send email to

Engineering Center Office Tower
ECOT 717
FAX +1-303-492-2844
XHTML 1.0/CSS2 ©2012 Regents of the University of Colorado
Privacy · Legal · Trademarks
May 5, 2012 (14:01)