Steve Hedetniemi's PhD students:

1.  Curtis J. Cook, University of Iowa, Dept. of Computer Science,
1970, "Graphs associated with (0,1) arrays".

        Curt is now a Professor of Computer Science at
Oregon State University in Corvallis, OR.

2.  Peter J. Slater, University of Iowa, Dept.of Mathematics,
1973, "Classifying n-connected graphs".

        Pete is now a Professor of Mathematics at the
University of Alabama in Huntsville, AL.

3.  Frances Van Scoy, University of Virginia, Dept. of Applied
Math and Computer Science, 1976, "Parallel algorithms in
cellular spaces".

        Fran is now a Professor of Computer
Science at the University of West Virginia in Morgantown, WV.

4.  Sandra L. Mitchell, University of Virginia, Dept. of Applied
Math and Computer Science, 1977, "Algorithms on trees and maximal
outerplanar graphs: design, complexity analysis and data structures
study".

        Sandee is now a Professor of Computer Science
at Clemson University  in Clemson, SC.

5.  Thomas V. Wimer, Clemson University, Dept. of Computer Science,
1987, "Linear algorithms on k-terminal graphs".

        Tom is now a Professor of Mathematics at
Clarion University of Pennsylvania in Clarion, PA.

6.  Gayla S. Domke, Clemson University, Dept. Mathematical Sciences,
joint with Renu Laskar), 1987, "Variations of colorings, coverings
and packings of graphs".

        Gayla is now an Associate Professor of
Mathematics at Georgia State University in Atlanta, GA.

7.  Eleanor O. Hare, Clemson University, Dept. of Computer Science,
1989, "Algorithms for grids and grid-like graphs".

        Eleanor is now a tenured Assistant Professor of
Computer Science at Clemson University in Clemson, SC.

8.  Chandrasekharan Narayanan, Clemson University, Dept. of
Mathematical Sciences, 1989, "Fast parallel algorithms and
enumeration techniques for partial k-trees".

        Chandra is now an Associate Professor of Computer
Science at Loyola University in Chicago.

9.  Aniket Majumdar, Clemson University, Dept. of Mathematical
Sciences, joint with Renu Laskar, 1991, "Neighborhood hypergraphs:
a framework for covering and packing parameters in graphs".

        Aniket is now an Assistant Professor of Mathematics
at Indiana University - Purdue University in Ft. Wayne, IN.

10.  Alice A. McRae, Clemson University, Dept. of Computer Science,
1994, "Generalizing NP-completeness proofs for bipartite and
chordal graphs".

        Alice is now an Assistant Professor of Computer
Science at Appalachian State University in Boone, NC.

11.  Frederick C. Harris, Jr., Clemson University, Dept. of
Computer Science, 1994, "Parallel computation of Steiner Minimal
Trees".

        Fred is now an Assistant Professor of Computer Science
at the University of Nevada in Reno, NV.