Curriculum Vita

Donald L. Kreher

Last updated Jul 15, 2025

Address

University Education

Employment

Research Interests

Funded Research and Projects

  1. Principal investigator on Improvements and applications of the Lenstra, Lenstra, Lovász Basis Reduction Algorithm (with S. P. Radziszowski), $27,183, at Rochester Institute of Technology, Fall, 1986, Supported by NSF Grant DCR-8606378.
  2. Principal investigator on Computing Combinatorial Configurations: t-Designs and Ramsey Numbers (with S. P. Radziszowski), $70,747, at Rochester Institute of Technology, Fall, 1987 and Fall 1988, Supported by NSF Grant CCR-8711229.
  3. Principal investigator on Computer Search for Elusive Combinatorial Configurations: A Research Toolchest (with S. P. Radziszowski), $41,216, at Rochester Institute of Technology, Summer 1990, Supported by NSF Grant CCR-8920692.
  4. Principal investigator on Computing Combinatorial Configurations, $21,808, at Michigan Technological University, Summer 1992 and Summer 1993, Supported by NSA grant MDA904-92-H-3036.
  5. Co-investigator on Second Upper Michigan Combinatorics Workshop on Codes, Designs and Geometries, (with A. H. Baartmans and V. D. Tonchev), $8,460, at Michigan Technological University, Summer 1994 Summer 1994, Supported bf NSF Grant DMS-9402637.
  6. Summer support at the University of Queensland, Brisbane, Australia, $4,000A, Supported by Raybould Fellowship.
  7. Principal investigator on Combinatorial Configurations: t-designs and Orthogonal Arrays $14,936, at Michigan Technological University, Summer 1996 and Summer 1997, Supported by NSA grant MSPF-96G-103.

Awards

1995 Hall Medal
The Hall Medal is awarded by the Institute of Combinatorics and its Applications. It is for recognition of an extensive and significant body of research work of exceptional quality.

Publications in print

    1974 to 1979

  1. D.L. Kreher, Thimble magic, MUM 63 (March 1974), 14-15.
  2. D.L. Kreher, How a magic show succeeds, MUM 63 (March 1974), 28.

    1980 to 1984

  3. E.S. Kramer, D.L. Kreher, S.S. Magliveras and D.M. Mesner, Coherent Room rectangles from permutation groups, Ars Combin. 9 (1980), 101-111.
  4. E.S. Kramer, D.L. Kreher, S.S. Magliveras and D.M. Mesner, An assortment of Room-type designs, Ars Combin. 11 (1981), 9-29.
  5. E.S. Kramer, D.L. Kreher and D.M. Mesner, Some crowded Room rectangles, Ars Combin. 13 (1982), 71-85.
  6. L.G. Chouinard, II, E.S. Kramer and D.L. Kreher, Graphical t-wise balanced designs, Discrete Math. 46 (1983), 227-240.

    1985 to 1989

  7. D.L. Kreher, An incidence algebra for t-designs with automorphisms, J. Combin. Theory Ser. A 42 (1986), 239-251.
  8. D.L. Kreher and S.P. Radziszowski, The existence of simple 6-(14,7,4) designs, J. Combin. Theory Ser. A 43 (1986), 237-243.
  9. D.L. Kreher and S.P. Radziszowski, Finding simple t-designs by using basis reduction, Congr. Numer. 55 (1986), 235-244.
  10. D.L. Kreher and S.P. Radziszowski, Simple 5-(28,6,λ) designs from PSL2(27), in "Combinatorial design theory" North-Holland, Amsterdam (1987), 315-318.
  11. D.L. Kreher and S.P. Radziszowski, New t-designs found by basis reduction, Congr. Numer. 59 (1987), 155-164.
  12. S.P. Radziszowski and D.L. Kreher, Search algorithm for Ramsey graphs by union of group orbits, J. Graph Theory 12 (1988), 59-72.
  13. S.P. Radziszowski and D.L. Kreher, Solving subset sum problems with the L3 algorithm, J. Combin. Math. Combin. Comput. 3 (1988), 49-63.
  14. S.P. Radziszowski and D.L. Kreher, On (3,k) Ramsey graphs: theoretical and computational results, J. Combin. Math. Combin. Comput. 4 (1988), 37-52.
  15. D.L. Kreher, W. Li and S.P. Radziszowski, Lower bounds for multi-colored Ramsey numbers from group orbits, J. Combin. Math. Combin. Comput. 4 (1988), 87-95.
  16. S.P. Radziszowski and D.L. Kreher, Upper bounds for some Ramsey numbers R(3,k), J. Combin. Math. Combin. Comput. 4 (1988), 207-212.
  17. D. de Caen, D.L. Kreher and J. Wiseman, On constructive upper bounds for the Turán numbers T(n,2r+1,2r), Congr. Numer. 65 (1988), 277-280.
  18. D.L. Kreher, A generalization of Connor's inequality to t-designs with automorphisms, J. Combin. Theory Ser. A 50 (1989), 259-268.
  19. P. Horák, D.L. Kreher and A. Rosa, Jointly extendable Latin rectangles, Utilitas Math. 36 (1989), 193-195.
  20. E.S. Kramer, D.L. Kreher, R. Rees and D.R. Stinson, On perpendicular arrays with t ≥ 3, Ars Combin. 28 (1989), 215-223.

    1990 to 1994

  21. D. de Caen, D.A. Gregory, I.G. Hughes and D.L. Kreher, Near-factors of finite groups, Ars Combin. 29 (1990), 53-63.
  22. Y.M. Chee, C.J. Colbourn and D.L. Kreher, Simple t-designs with v ≤ 30, Ars Combin. 29 (1990), 193-258.
  23. D.L. Kreher, A 4-(15,5,5) design, in "Coding theory and design theory, Part II" Springer, New York (1990), 226.
  24. D.L. Kreher, Design theory toolchest-user manual and report, in "Coding theory and design theory, Part II" Springer, New York (1990), 227-235.
  25. D.L. Kreher, Y.M. Chee, D. de Caen, C.J. Colbourn and E.S. Kramer, Some new simple t-designs, J. Combin. Math. Combin. Comput. 7 (1990), 53-90.
  26. D.L. Kreher and S.P. Radziszowski, Constructing 6-(14,7,4) designs, in "Finite geometries and combinatorial designs (Lincoln, NE, 1987)" Amer. Math. Soc., Providence, RI (1990), 137-151.
  27. D. de Caen, D.L. Kreher and J.A. Wiseman, A Turán problem for Cartesian products of hypergraphs, J. Combin. Math. Combin. Comput. 8 (1990), 17-25.
  28. Y.M. Chee, C.J. Colbourn, S.C. Furino and D.L. Kreher, Large sets of disjoint t-designs, Australas. J. Combin. 2 (1990), 111-119.
  29. S.P. Radziszowski and D.L. Kreher, Minimum triangle-free graphs, Ars Combin. 31 (1991), 65-92.
  30. D. de Caen, D.L. Kreher, S.P. Radziszowski and W.H. Mills, On the covering of t-sets with (t+1)-sets: C(9,5,4) and C(10,6,5), Discrete Math. 92 (1991), 65-77.
  31. T.C. Frenz and D.L. Kreher, An algorithm for enumerating distinct cyclic Steiner systems, J. Combin. Math. Combin. Comput. 11 (1992), 23-32.
  32. E.J. Billington and D.L. Kreher, Yet another characterization of the Petersen graph, Bull. Inst. Combin. Appl. 7 (1993), 73-77.
  33. D. de Caen and D.L. Kreher, The 3-hypergraphical Steiner quadruple systems of order twenty, in "Graphs, matrices, and designs" Dekker, New York (1993), 85-92.
  34. D.L. Kreher, D. de Caen, S.A. Hobart, E.S. Kramer and S.P. Radziszowski, The parameters 4-(12,6,6) and related t-designs, Australas. J. Combin. 7 (1993), 3-20.
  35. Y.M. Chee and D.L. Kreher, 4-(21,5,λ) designs from a group of order 171, Ars Combin. 36 (1993), 199-205.
  36. D.L. Kreher, An infinite family of (simple) 6-designs, J. Combin. Des. 1 (1993), 277-280.
  37. D.G. Hoffman and D.L. Kreher, The bigraphical t-wise balanced designs of index 1, J. Combin. Des. 2 (1994), 41-48.
  38. D.L. Kreher, Simple t-designs with large t: a survey, J. Combin. Math. Combin. Comput. 15 (1994), 97-109.
  39. E.D. Boyer, D.L. Kreher, S.P. Radziszowski and A. Sidorenko, On (n,5,3)-Turán systems, Ars Combin. 37 (1994), 13-31.

    1995 to 1999

  40. C.A. Cusack, S.W. Graham and D.L. Kreher, Large sets of 3-designs from PSL(2,q), with block sizes 4 and 5, J. Combin. Des. 3 (1995), 147-160.
  41. C.J. Colbourn, C.A. Cusack and D.L. Kreher, Partial Steiner triple systems with equal-sized holes, J. Combin. Theory Ser. A 70 (1995), 56-65.
  42. L.M. Weiss and D.L. Kreher, The bigraphical t-wise balanced designs of index two, J. Combin. Des. 3 (1995), 233-255.
  43. E.J. Billington and D.L. Kreher, The intersection problem for small G-designs, Australas. J. Combin. 12 (1995), 239-258.
  44. M.J. Gilpin and D.L. Kreher, A note on spanning trees in near d-angulations, Ars Combin. 41 (1995), 189-192.
  45. D.L. Kreher, Constructing t-designs with t > 3, Congr. Numer. 112 (1995), 173-184.
  46. D.L. Kreher, Orthogonal arrays of strength 3, J. Combin. Des. 4 (1996), 67-69.
  47. D.L. Kreher, G.F. Royle and W.D. Wallis, A family of resolvable regular graph designs, Discrete Math. 156 (1996), 269-275.
  48. C.J. Colbourn and D.L. Kreher, Concerning difference matrices, Des. Codes Cryptogr. 9 (1996), 61-70.
  49. E.S. Kramer, D.L. Kreher and R. Mathon, On Steiner 3-wise balanced designs of order 17, J. Combin. Des. 5 (1997), 125-145.
  50. D.L. Kreher and D.R. Stinson, Small group-divisible designs with block size four, J. Statist. Plann. Inference 58 (1997), 111-118.
  51. D.L. Kreher, D.R. Stinson and L. Zhu, On the maximum number of fixed points in automorphisms of prime order of 2-(v,k,1) designs, Ann. Comb. 1 (1997), 227-243.
  52. M.A. Chateauneuf, C.J. Colbourn and D.L. Kreher, Covering arrays of strength three, Des. Codes Cryptogr. 16 (1999), 235-242.
  53. L. Burgess, D.L. Kreher and D.J. Street, Small orthogonal main effect plans with four factors, Comm. Statist. Theory Methods 28 (1999), 2441-2464.
  54. M.A. Chateauneuf, C.J. Colbourn, D.L. Kreher, E.R. Lamken and D.C. Torney, Pooling, lattice square, and union jack designs, Ann. Comb. 3 (1999), 27-35.

    2000 to 2004

  55. C.L. Olsen and D.L. Kreher, Steiner graphical t-wise balanced designs of type nr, J. Statist. Plann. Inference 86 (2000), 535-566, special issue in honor of Professor Ralph Stanton.
  56. L. Burgess, D.L. Kreher and D.J. Street, Erratum: "Small orthogonal main effect plans with four factors" [Comm. Statist. Theory Methods 28 (1999), no. 10, 2441-2464; MR1720537 (2000f:05017)], Comm. Statist. Theory Methods 29 (2000), 903.
  57. D.L. Kreher and R.S. Rees, A hole-size bound for incomplete t-wise balanced designs, J. Combin. Des. 9 (2001), 269-284.
  58. D.L. Kreher, United we stand: A quick production of the american flag, MUM 96 (March 2001), 12-13.
  59. C.J. Colbourn, D.L. Kreher, J.P. McSorley and D.R. Stinson, Orthogonal arrays of strength three from regular 3-wise balanced designs, J. Statist. Plann. Inference 100 (2002), 191-195.
  60. M. Chateauneuf and D.L. Kreher, On the state of strength-three covering arrays, J. Combin. Des. 10 (2002), 217-238.
  61. I. Adamczak, D.L. Kreher, A.C.H. Ling and R.S. Rees, Further results on the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size, J. Combin. Des. 10 (2002), 256-281.
  62. D.L. Kreher and R.S. Rees, On the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size, in "Codes and designs (Columbus, OH, 2000)" de Gruyter, Berlin (2002), 179-186.
  63. M. Greig, D.L. Kreher and A.C.H. Ling, On PBIBD designs based on triangular schemes, Ann. Comb. 6 (2002), 147-155.
  64. D.L. Kreher, A.C.H. Ling, R.S. Rees and C.W.H. Lam, A note on {4}-GDDs of type 210, Discrete Math. 261 (2003), 373-376.
  65. M.S. Keranen, D.L. Kreher and P.J.-S. Shiue, Quadruple systems of the projective special linear group PSL(2,q),q ≡ 1 mod 4, J. Combin. Des. 11 (2003), 339-351.
  66. M.S. Keranen and D.L. Kreher, 3-designs of PSL(2,2n) with block sizes 4 and 5, J. Combin. Des. 12 (2004), 103-111.
  67. H.-D.O.F. Gronau, D.L. Kreher and A.C.H. Ling, Super-simple (v,5,2)-designs, Discrete Appl. Math. 138 (2004), 65-77.
  68. I. Adamczak, D.L. Kreher and R.S. Rees, Tight incomplete block designs, Discrete Math. 284 (2004), 11-20.

    2005 to 2009

  69. K.A. Lauinger, D.L. Kreher, R. Rees and D.R. Stinson, Computing transverse t-designs, J. Combin. Math. Combin. Comput. 54 (2005), 33-56.
  70. B. Alspach, D. Dyer and D.L. Kreher, On isomorphic factorizations of circulant graphs, J. Combin. Des. 14 (2006), 406-414.
  71. M.S. Keranen and D.L. Kreher, Transverse quadruple systems with five holes, J. Combin. Des. 15 (2007), 315-340.
  72. L.R. Thimm, D.L. Kreher and P. Merkey, A parallel implementation for the maximum clique problem, J. Combin. Math. Combin. Comput. 63 (2007), 183-207.
  73. A.A. Zhuravlev, M.S. Keranen and D.L. Kreher, Small group divisible Steiner quadruple systems, Electron. J. Combin. 15 (2008), Research paper 40, 14 pp.
  74. H. Cao, J. Dinitz, D. Kreher, D.R. Stinson and R. Wei, On orthogonal generalized equitable rectangles, Des. Codes Cryptogr. 51 (2009), 225-230.
  75. E.E. Westlund, J. Liu and D.L. Kreher, 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable, Discrete Math. 309 (2009), 5106-5110.
  76. M.S. Keranen, D.L. Kreher, W. Kocay and P.C. Li, Degree sequence conditions for partial Steiner triple systems, Bull. Inst. Combin. Appl. 57 (2009), 71-73.
  77. M.S. Keranen and D.L. Kreher, Correction to: "Transverse quadruple systems with five holes" [mr2330085], J. Combin. Des. 17 (2009), 492-495.

    2010 to 2014

  78. D.L. Kreher and E.E. Westlund, n-isofactorizations of 8-regular circulant graphs, J. Combin. Math. Combin. Comput. 72 (2010), 197-209.
  79. M.S. Keranen, D.L. Kreher and S. Özkan, Uniform two-class regular partial Steiner triple systems, J. Combin. Des. 20 (2012), 161-178.
  80. B. Alspach, C. Caliskan and D.L. Kreher, Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups, Discrete Math. 313 (2013), 1475-1489.
  81. B. Alspach, D. Bryant and D.L. Kreher, Vertex-transitive graphs of prime-squared order are Hamilton-decomposable, J. Combin. Des. 22 (2014), 12-25.
  82. C.J. Colbourn, M.S. Keranen and D.L. Kreher, f-vectors of pure complexes and pure multicomplexes of rank three, Discrete Math. 320 (2014), 26-39.
  83. W.L. Kocay and D.L. Kreher, On reconstructing graphs and their complements, SIAM J. Discrete Math. 28 (2014), 1026-1034.

    2015 to 2019

  84. D.L. Kreher, A. Pastine and L. Tollefson, A note on the cyclic matching sequencibility of graphs, Australas. J. Combin. 61 (2015), 142-146.
  85. C.J. Colbourn, M.S. Keranen and D.L. Kreher, The 3-GDDs of type g3u2, J. Algebra Comb. Discrete Struct. Appl. 3 (2016), 135-144.
  86. B. Alspach, D.L. Kreher and A. Pastine, The Friedlander-Gordon-Miller conjecture, Australas. J. Combin. 67 (2017), 11-24.
  87. W.J. Keith, D. Froncek and D.L. Kreher, A note on nearly platonic graphs, Australas. J. Combin. 70 (2018), 86-103.
  88. W.J. Keith, D. Froncek and D.L. Kreher, Corrigendum to: a note on nearly platonic graphs [MR3723777], Australas. J. Combin. 72 (2018), 163.
  89. J. Hodaj, M.S. Keranen, D.L. Kreher and L. Tollefson, Some new Kirkman signal sets, Des. Codes Cryptogr. 86 (2018), 2183-2195.
  90. D.L. Kreher and D.R. Stinson, Nonsequenceable Steiner triple systems, Bull. Inst. Combin. Appl. 86 (2019), 64-68.
  91. B. Alspach, A. Khodadadpour and D.L. Kreher, On factor-invariant graphs, Discrete Math. 342 (2019), 2173-2178.
  92. D.L. Kreher and D.R. Stinson, Block-avoiding sequencings of points in Steiner triple systems, Australas. J. Combin. 74 (2019), 498-509.

    2020 to present

  93. M.S. Keranen, D.L. Kreher, S. Milici and A. Tripodi, Uniformly resolvable decompositions of Kv in 1-factors and 4-stars, Australas. J. Combin. 76 (2020), 55-72.
  94. D.L. Kreher, D.R. Stinson and S. Veitch, Block-avoiding point sequencings of directed triple systems, Discrete Math. 343 (2020), 111773, 10 pp.
  95. D.L. Kreher, D.R. Stinson and S. Veitch, Block-avoiding point sequencings of Mendelsohn triple systems, Discrete Math. 343 (2020), 111799, 7 pp.
  96. B. Alspach, D.L. Kreher and A. Pastine, Sequencing partial Steiner triple systems, J. Combin. Des. 28 (2020), 327-343.
  97. D.L. Kreher, Graphical designs, in "50 years of combinatorics, graph theory, and computing" DISCRETE MATH. APPL. (BOCA RATON) CRC Press, Boca Raton, FL ([2020] © 2020), 301-317.
  98. D.L. Kreher, The extended graphical and bigraphical generalized Steiner systems, Bull. Inst. Combin. Appl. 98 (2023), 140-147.
  99. C.J. Colbourn, D.L. Kreher and P.R.J. Östergård, Bussey systems and Steiner's tactical problem, Glas. Mat. Ser. III 58(78) (2023), 201-224.
  100. S.R. Blackburn, N.N. Esfahani, D.L. Kreher and D.R. Stinson, Constructions and bounds for codes with restricted overlaps, IEEE Trans. Inform. Theory 70 (2024), 2479-2490.
  101. D.L. Kreher and D.R. Stinson, On minimum-base palindromic representations of powers of 2, Integers 24 (2024), #A69.
  102. D.K. M. Epstein and S. Magliveras, Small transitive homogeneous 3-(v,{4,6},1) designs, in "Stinson 66 - New Advances in Designs, Codes and Cryptography", C.J. Colbourn and J. H. Dinitz, eds. Fields Inst. Commun. 86, Springer 2024.
  103. M. Buratti, D. L. Kreher, and D. R. Stinson, Nestings of BIBDs with block size four, J. Combin. Des., 32 (2024), 715-743. https://doi.org/10.1002/jcd.21957
  104. D.L. Kreher, D. L., M. B. Paterson, and D. R. Stinson, Strong External Difference Families and Classification of Valuations, J. Combin. Des., 33 (2025), 343-356. https://doi.org/10.1002/jcd.21985

Books

  1. D.L. Kreher and D.R. Stinson, Combinatorial Algorithms: generation, enumeration, and search, CRC Press, 1999.
  2. W. Kocay and D.L. Kreher, Graphs, algorithms, and optimization, DISCRETE MATHEMATICS AND ITS APPLICATIONS (BOCA RATON) CRC Press, Boca Raton, FL, 2005.
  3. W.L. Kocay and D.L. Kreher, Graphs, algorithms, and optimization, second edn. DISCRETE MATHEMATICS AND ITS APPLICATIONS (BOCA RATON) CRC Press, Boca Raton, FL, 2017.

Technical reports

  1. M.S. Keranen and D.L. Kreher, Existence of Kirkman signal sets on v=1,3 mod 6 points, 14 ≤ v ≤ 3000, https://arxiv.org/abs/1707.07282 (51 pages).
  2. D.L. Kreher, D.R. Stinson and S. Vietch, Good Sequencings for small directed triple systems, https://arxiv.org/abs/1909.06475 ( 305 pages).
  3. D.L. Kreher, D.R. Stinson and S. Vietch, Good Sequencings for small Mendelshon triple systems, https://arxiv.org/abs/1907.11186 (121 pages).

Software Distribution

  1. D.L. Kreher and D.R. Stinson. The CTAN macros/latex/contrib/pseudocode/ directory, Comprehensive TeX Archive Network, January 14, 2005.

Invited Talks

  1. Algebraic Methods in the Theory of Combinatorial Designs.
    1. Drexel University, 1984.
    2. Lehigh University, 1984.
    3. University of Vermont, 1984.
    4. University of Southern Maine, 1984.
    5. Rochester Institute of Technology, 1984.
  2. Codes, Designs and Groups.
    1. Rochester Institute of Technology 1985.
  3. Search Algorithm for Ramsey Graphs.
    1. University of Nebraska, 1986.
    2. State University of New York at Oswego, 1986.
  4. Combinatorial Search Algorithms: A Demonstration.
    1. University of Vermont, 1987.
  5. Constructing 6-(14,7,4) designs.
    1. University of Waterloo, Waterloo, Ontario, 1987.
    2. The 307th meeting of the American Mathematical Society, University of Nebraska, Lincoln Nebraska, November 1987.
  6. Computing Combinatorial Configurations.
    1. 3rd Ontario Combinatorics Workshop, University of Waterloo, Waterloo, Ontario, 1987
    2. McMaster University, Hamilton Ontario, 1988.
    3. University of Wyoming, Laramie, Wyoming, 1988.
    4. Syracuse University, Syracuse, New York, 1988.
    5. Michigan Technological University, Houghton Michigan, 1991.
    6. University of West Virginia, Morgantown, West Virginia, 1991.
  7. A Design Theory Toolchest
    1. Eighteenth Annual Conference on Numerical Mathematics and Computing, University of Manitoba, Winnipeg, Manitoba, September 1988.
    2. Institute for Mathematics and its Applications Workshops on Coding Theory and Applications and on Design Theory and Applications, University of Minnesota, Minneapolis, Minnesota, June 12-25, 1988.
  8. Large Sets of Disjoint t-Designs
    1. The 859th meeting of the American Mathematical Society, Columbus, Ohio, August 1990.
    2. The 97th Annual meeting of the American Mathematical Society, San Francisco, California, January 1991.
  9. On Turán's Problem on Hypergraphs.
    1. University of Colorado, Denver, Colorado, December 1990.
    2. Auburn University , Auburn, Alabama , March 1991.
    3. University of Vermont, February 1999.
  10. t-designs with Large t: A survey.
    1. The Seventh Midwestern Conference on Combinatorics, Cryptography and Computing, Carbondale, Illinois, October, 1992.
  11. Large sets of quadruple systems from PSL2(q).
    1. Auburn University, Auburn, Alabama, March 1993.
  12. Large sets of 3-designs from PSL(2,q), with block sizes 4 and 5,
    1. University of Nebraska, Lincoln, Nebraska, October 1993.
  13. Constructing t-designs with t ≥ 3.
    1. Twenty sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 1995.
  14. On Orthogonal Arrays of strength 3.
    1. The R.C. Bose memorial conference, Ft. Collins, Colorado, June 1995.
  15. Hunting t-Designs with t > 3.
    1. The Twenty-second Australasian Conference on Combinatorial Mathematics and Combinatorial Computing,
    2. Sydney, Australia, July, 1996. University of Auckland, Auckland, New Zealand, July 1996.
  16. From t-Wise Balanced Designs to Orthogonal Arrays.
    1. Central Michigan University, Mt. Pleasant Michigan, January 1997.
    2. CRM Workshop on Transversal Designs and Orthogonal Arrays, Kitchener-Waterloo, Ontario, CANADA, April 1997.
    3. University of Nevada-Las Vegas, Las Vegas, Nevada, February 2002.
  17. Covering arrays of strength 3.
    1. University of Nebraska, February 1998.
    2. University of Vermont, February 1998.
    3. Center for Nonlinear Research at Los Alamos, July 1998.
  18. Graphical Designs
    1. University of Vermont, February 1998.
  19. Computing Cliques
    1. University of Vermont, May 1998.
    2. University of Nebraska, May 1998.
    3. Rochester Institute of Technology, Sept 1999.
  20. Constructing Arrays
    1. Second Pythagorean Conference, An Advanced Research Workshop in Geometry, Combinatorial Designs & Related Structures. Pythagoreion, Samos, Greece, June 1999.
  21. Covering Arrays of Strength 3
    1. University of Rochester, Sept 1999.
    2. Rochester Institute of Technology, Sept 1999.
  22. A Hole-size bound for incomplete t-wise balanced designs
    1. The XXVth Ohio State-Denison Mathematics Conference, May 2000.
    2. Optimal Discrete Structures and Algorithms - ODSA, Rostock (Germany), September 2000.
    3. The Second Lethbridge Workshop onCryptography Designs, Codes, Cryptography and Graph Theory, June 2001.
  23. Magic Squares and Orthogonal Arrays
    1. University of Nevada-Las Vegas, Las Vegas, Nevada, February 2002.
    2. University of Minnesota Duluth, Duluth, Minnesota, November 3, 2011
  24. Computing Transverse t-Designs
    1. First Prairie Discrete Mathematics Workshop Regina, Saskatchewan, October 2003.
    2. Eighteen Midwestern Conference on Combinatorics, Cryptography and Computing, Las Vegas, Nevada, October 2004.
  25. Isofactorizations of circulant graphs
    1. Fourth Prairie Discrete Mathematics Workshop Lethbridge, Alberta, August 2006.
  26. The hypergraph degree sequence problem
    1. Thirty ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 2008.
  27. Hamilton decomposition of circulant graphs of order p2.
    1. University of Arizona, Tempe, Arizona, February 2013.
  28. Vertex-Transitive Graphs Of Prime-Squared Order Are Hamilton-Decomposable.
    1. University of Minnesota Duluth, Duluth, Minnesota, May 2013.
  29. Groups Designs and Linear Algebra: Orbit incidence matrices.
    1. (3 lectures) University of Newcastle, Newcastle, Australia, March 2012.
    2. (5 lectures) CIMPA School ECOS 2013 held at National University of San Luis, San Luis, Argentina, July 2013.
  30. The Degree Sequence Problem For Partial Steiner Triple Systems
    1. University Wisconsin October 5, 2012

Ph.D. students

  1. Cheryl L. Olson, Ph.D. (Maths), On Graphical Designs, University of Nebraska-Lincoln, 1997. (co-supervised with E.S. Kramer.)
  2. Mike Ira, Ph.D. (Maths), TriGraphical Designs, University of Nebraska-Lincoln, (co-supervised with E.S. Kramer.) 2000.
  3. Mark Chateauneuf, Ph.D. (Maths), Covering arrays, Michigan Technological University, 2000.
  4. Izabela B. Adamczak, Ph.D. (Maths), Tight Incomplete Block designs, Michigan Technological University, 2002.
  5. Melissa S. Keranen Ph.D. (Maths), Transverse Steiner quadruple system, Michigan Technological University, 2005.
  6. Erik E. Westlund, Ph.D. (Maths), Hamilton decompositions of 6-regular Abelian Cayley Graphs, Michigan Technological University, 2010.
  7. Adrian Pastine Ph.D. (Maths), Two Problems of Gerhard Ringel, Michigan Technological University, 2016.

Master's students

  1. P. A. Eggleston, M.S. (CS), Detection and Coding of Edges in Natural Scenes: Building a Fact Base for an Expert System, 1986.
  2. R. E. Hill, M.S. (CS), ACL: A Combinatorics Language, 1986.
  3. R. T. Salamone, M.S. (CS), An Implementation of the Chor-Rivest Knapsack Type Public Key Cryptosystem, 1986.
  4. R. Nenno, M.S. (CS), Nonlinear Error-correcting Codes, 1987.
  5. Wei Li, M.S. (CS), Algorithms for Constructing Multicolor Ramsey Graphs, 1987.
  6. A. Stankus, M.S. (CS), Implementing Ray Tracing with Techniques from Image Processing, 1987.
  7. J. E. Robinson, M.S. (CS), A Noiseless Data Compression Method Suitable for In-line Communication Channel Use, 1988.
  8. S. Metha, M.S. (CS), A Window-Oriented User-Interface for Image Processing on Unix Based Workstations, 1988.
  9. T. C. Frenz, M.S. (CS), Computing Techniques for the Enumeration of Cyclic Steiner Systems, 1989.
  10. N. M. Schornstein, M.S. (CS), Computing the Chromatic Number of t-(v,k,λ) Designs, 1989.
  11. W. J. Monroe, M.S. (CS), Computer Construction of (4,4,c)-Threshold Schemes using Steiner Quadruple Systems, 1989.
  12. C. A. Cusack, M.S. (Maths), PSL(2,q) as an automorphism group of 3-designs with blocksize 4, 1994.
  13. L. M. Koehn, M.S. (Maths), The Bigraphical t-Wise Balanced Designs of Index Two, 1994.
  14. Jun Meng, M.S. (Maths), Some new orthogonal arrays of strength 2, 1995.
  15. Hrsito S. Sendov, M.S. (Maths), A Graph Decomposition Theorem, 1996.
  16. Melissa S. Keranen, M.S. (Maths), An Infinite Class of Fibres In CURDs 2002.
  17. Kimberly Lauinger, M.S. (Maths), Computing Transverse t-designs 2003.
  18. Lisa Thimm, M.S. (Maths) A Unified Parallel C Implementation for the Maximum Clique Problem, 2005
  19. Erik E. Westlund, M.S. (Maths), n-Isofactorizations of Circulant Graphs, 2006
  20. Artem Zurhalev, M.S. (Maths) Group Divisible Steiner Quadruple Systems, 2007.
  21. Rachel Rupnow M.S. (Maths) A Survey of Distance Magic Graphs Masters' Advisory Committee Member, Mathematical Sciences. 2015.