Dr. Kierstead works in the areas of recursive combinatorics and on-line algorithms, extremal graph theory, and partially ordered sets. He is particularly interested in problems concerning graph coloring, both on-line and off-line. Other interests include polynomial time approximation algorithms, hamiltonian cycles in graphs, and dimension theory for ordered sets.
|
