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 · 

Theses Advised by Harold (Hal) Gabow

by Year by Author by Advisor
 Johnston, Keith Douglas
MS 1976
The design of the programming language GEFOR
 Malanowicz, Kenneth R.
MS 1977
Improving lower bounds for selection problems
 Saphier, David Jay
MS 1979
The evaluation of expressions with and without common subexpressions
 Ubelmesser, Robert A.
MS 1979
Finding smallest spanning trees with one degree constraint
 Hansen, Tracy Lee
MS 1980
Triconnectivity, triconnected components and separation pairs
 Warmuth, Manfred Klaus
MS 1980
M processor unit-execution-time scheduling reduces to M-1 weakly connected components
 Yuan, John Jung
MS 1980
Two improved methods for assignment problems
 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
 Havens, Barbara Patrice
MS 1983
Experiments on an asymptotically optimum, special purpose set merging algorithm
 Westermann, Herbert Hans
MS 1983
An analysis of the power of chain rules in context-free grammars
 Crocker, Steven Toye
MS 1984
Implementations and timings on three algorithms for the degree constrained subgraph problem
 Bateson, Carol Ann
MS 1985
Performance comparison of two algorithms for weighted bipartite matchings
 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
 Kohno, Tadayoshi
BS 1999
Clearance matching
 Brinkman-Davis, Shane
MS 2001
Improved implementation of the Goemans-Williamson approximate minimum-weight perfect matching algorithm
 Skulrattanakulchai, San
PhD 2002
Efficient algorithms for graph coloring: vertex, edge, list, total, and acyclic coloring
 Duda, Michael Gregory
MS 2005
On the complexity of a two-activity scheduling problem
 Scheder, Dominik Alban
MS 2005
Approaches to approximating the minimum weight k-edge connected spanning subgraph of a mixed graph
 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 (13:58)