Donald L. Kreher

Donald L. Kreher

Contact

Download CV

Professor, Mathematical Sciences

  • PhD, Mathematics and Statistics, University of Nebraska-Lincoln

Biography

Obtained a joint computer science and mathematics PhD 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 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, Florida, 2005. 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.

Links of Interest

Areas of Expertise

  • Design theory
  • Combinatorial algorithms

Recent Publications

  • D.L. Kreher and E.E. Westlund, n-isofactorization of 8-regular circulant graphs, J. Combin. Mathematics and Combin. Computing, 67 , (2010) 197-209 .
  • H. Cao, J. Dinitz, D.L. Kreher, D.R. Stinson and R. Wei, On orthogonal generalized equitable rectangles, Des. Codes Cryptogr. 51 (2009), no. 3, 225-230.
  • E.E. Westlund, J. Liu, Jiuqiang and D.L. Kreher 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable, Discrete Math. 309 (2009), no. 16, 5106-5110. 05C25
  • M.S. Keranen, D.L. Kreher, W. Kocay and Pak Ching Li, Degree sequence conditions for partial Steiner triple systems. Bull. Inst. Combin. Appl. 57 (2009), 71-73. 05B07
  • M.S. Keranen, and D.L. Kreher, Correction to: Transverse quadruple systems with five holes, J. Combin. Des. 17 (2009), no. 6, 492-495. 05B05

Research

  • 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 and the design and analysis of combinatorial algorithms for problems considered almost intractable.