- Donald L. Kreher
- obtained a joint computer science and mathematics Ph.D. from
the University of Nebraska in 1984. He has held academic positions at Rochester
Institute of Technology and the University of Wyoming. He is currently a
University Professor of Mathematical Sciences at Michigan Technological
University, where he teaches and conducts research in combinatorics and
combinatorial algorithms. He has published numerous research papers and is a
co-author of the internationally acclaimed texts: "Combinatorial Algorithms:
Generation Enumeration and Search", CRC Press, Boca Raton, Florida, 1999 and
"Graph Algorithms and Optimization", Chapman & Hall/CRC Press , Boca Raton,
In 1995, Professor Kreher was awarded the Marshall Hall Medal, awarded by the
Institute of Combinatorics and its Applications.
His research interests include computational and algebraic methods for
determining the structure and existence of combinatorial configurations, such
as designs, graphs, error-correcting codes, cryptographic systems and extremal
set systems. Applications of combinatorial configurations to computer science
and information theory. Design and analysis of combinatorial algorithms for
problems considered almost intractable.
His research interests have applications in scheduling theory, hardware and
software testing, in particular telephone switching hardware. In addition, he
has done quantitative work in the casino industry.