Curriculum Vita
Curriculum Vita
Donald L. Kreher
Last updated Mar 20, 2014
Address
Department of Mathematical Sciences
Michigan Technological University
Houghton, Michigan 49931
Office phone: (906)4873542
University Education
B.A. in Computer Science and in Mathematics (Cum Laude),
State University of New York at Oswego, 1977.
M.A. in Mathematics, Michigan State University, 1979.
Ph.D in the joint program of Computer Science and Mathematics,
University of NebraskaLincoln, 1984.
Employment
Teaching Assistant, Michigan State University, 19771979.
Instructor and Teaching Assistant, University of Nebraska, 19791984.
Assistant professor, Rochester Institute of Technology, 19841988.
Associate professor, Rochester Institute of Technology, 19881989.
Visiting Associate professor, University of Wyoming , 19891991.
Associate professor, Michigan Technological University, 19911993.
Professor, Michigan Technological University, 1993present.
Research Interests
Computational and algebraic methods for determining the structure and existence
of combinatorial configurations, such as designs, graphs,
errorcorrecting 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.
Funded Research and Projects
 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 DCR8606378.

Principal investigator on "Computing Combinatorial Configurations: tDesigns and Ramsey Numbers"
(with S. P. Radziszowski), $70,747,
at Rochester Institute of Technology,
Fall, 1987 and Fall 1988, Supported by NSF Grant CCR8711229.

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 CCR8920692.

Principal investigator on "Computing Combinatorial Configurations,"
$21,808, at Michigan Technological University, Summer 1992 and Summer 1993,
Supported by NSA grant MDA90492H3036.

Coinvestigator 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 DMS9402637.

Summer support at the University of
Queensland, Brisbane, Australia, $4,000A, Supported by
Raybould Fellowship.

Principal investigator on "Combinatorial Configurations: tdesigns and
Orthogonal Arrays" $14,936, at Michigan Technological University, Summer 1996 and Summer 1997,
Supported by NSA grant MSPF96G103.
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

D.L. Kreher,
Thimble Magic,
MUM 63 (March 1974) 1415.

D.L. Kreher,
How a magic show succeeds,
MUM 63 (March 1974) 28.
1980 to 1984

E.S. Kramer, D.L. Kreher, S.S. Magliveras and D.M. Mesner,
Coherent Room Rectangles from Permutation Groups,
Ars Combinatoria
9 (1980) 101111.

E.S. Kramer, D.L. Kreher, S.S. Magliveras and D.M. Mesner,
Coherent Room Rectangles from Permutation Groups,
Ars Combinatoria
9 (1980) 101111.

E.S. Kramer, D.L. Kreher, S.S. Magliveras and D.M. Mesner,
An Assortment of RoomType Designs,
Ars Combinatoria
11 (1981) 929.

E.S. Kramer, D.L. Kreher and D.M. Mesner,
Some Crowded Room Rectangles,
Ars Combinatoria
11 (1982) 7185

L.G. Chouinard, D.L. Kreher and E.S. Kramer,
Graphical twise Balanced Designs,
Discrete Mathematics
46 (1983) 227240.
1985 to 1989

D.L. Kreher,
An Incidence Algebra for Combinatorial Designs with Automorphisms,
Journal of Combinatorial Theory Series A
Vol. 42, No 2. July 1986 239251.

D.L. Kreher and S. P. Radziszowski,
Finding Simple tDesigns by Using Basis Reduction,
Congressus Numerantium
Proceedings of the 17th Southeastern Conference on Combinatorics,
Graph Theory and Computing 55 (1986) 235244.

D.L. Kreher and S. P. Radziszowski,
The Existence of Simple 6(14,7,4) Designs
Journal of Combinatorial Theory Series A
43 , No. 2 (1986) 237243.

D.L. Kreher and S. P. Radziszowski,
Search Algorithm for Ramsey Graphs by Union of Group Orbits,
Journal of Graph Theory
12 No. 1 (1987) 5972.

D.L. Kreher and S. P. Radziszowski,
Simple 5(28,6,λ) Designs from PSL_{2}(27),
Annals of Discrete Mathematics 34,
special volume on Combinatorial Design Theory dedicated to Alexander Rosa
(edited by C.J. Colbourn and R.A. Mathon) NorthHolland Mathematics Studies
149 (1987) 315318.

D.L. Kreher and S. P. Radziszowski,
New tDesigns Found by Using Basis Reduction,
Congressus Numerantium
59 (1987) 155164.

D.L. Kreher and S. P. Radziszowski,
Solving SubsetSum Problems with the L^{3} Algorithm,
Journal of Combinatorial Mathematics and Combinatorial Computing
3 (1988) 4963.

D.L. Kreher and S. P. Radziszowski,
On (3,k) Ramsey Graphs: Theoretical and Computational Results,
Journal of Combinatorial Mathematics and Combinatorial Computing
4 (1988) 3752.

D.L. Kreher and S. P. Radziszowski,
Upper Bounds for Some Ramsey Numbers R(3,k)
Journal of Combinatorial Mathematics and Combinatorial Computing
4 (1988) 207212.

D.L. Kreher and S. P. Radziszowski and W. Li,
Lower bounds for Multicolor Ramsey Numbers From Group Orbits,
Journal of Combinatorial Mathematics and Combinatorial Computing
4 (1988) 8796.

D. de Caen, D.L. Kreher and J. Wiseman,
On Constructive Upper Bounds for the Turán numbers T(n,2r+1,2r),
Congressus Numerantium
65 (1988) 277280

D.L. Kreher,
A Generalization of Connors Inequality,
Journal of Combinatorial Theory Series A
50 (1989) 259268.

P. Horak, D.L. Kreher and A. Rosa,
Jointly Extendible Latin Rectangles,
Utilitas Mathematica
36 (1989) 193195.

D.L. Kreher, E.S. Kramer, R.Rees and D.R. Stinson,
On perpendicular arrays with t ≥ 3,
Ars Combinatoria 28 (1989) 215223.
1990 to 1994

D. de Caen, D. A. Gregory and I.G. Hughes and D.L.Kreher,
Nearfactors of Finite Groups,
Ars Combinatoria
29 (1990) 5363.

D.L. Kreher and S.P. Radziszowski,
Constructing 6(14,7,4) Designs,
Contemporary Mathematics
111 (1990) 137151.

Y. M. Chee, C. J. Colbourn and D.L. Kreher,
Simple tDesigns with v ≤ 30,
Ars Combinatoria 29 (1990) 193258.

D.L. Kreher,
A 4(15,5,5) design,
in Coding Theory and Design Theory: Part II Design Theory
ed. Dijen RayChaudhuri,
The IMA Volumes in Mathematics and its Applications
21 (1990) 226.

D.L. Kreher,
Design Theory Toolchest  User Manual and Report,
in Coding Theory and Design Theory: Part II Design Theory
ed. Dijen RayChaudhuri,
The IMA Volumes in Mathematics and its Applications
21 (1990) 227235.

Yeow Meng Chee, Charles J. Colbourn, Steven C. Furino and D.L. Kreher,
Large Sets of Disjoint tDesigns,
The Australasian Journal of Combinatorics 2 (1990) 111119.

D. de Caen, D.L. Kreher and J. A. Wiseman,
A Turán Problem for Cartesian Products of Hypergraphs,
The Journal of Combinatorial Mathematics and Combinatorial Computing
8 (1990) 1725.

D.L. Kreher, Y. M. Chee, D. de Caen, C.J. Colbourn and E.S. Kramer,
Some New Simple tDesigns,
The Journal of Combinatorial Mathematics and Combinatorial Computing
7 (1990) 5390.

D. de Caen, D.L. Kreher, W.H. Mills, and S.P. Radziszowski,
On the covering of tsets with (t+1)sets: C(9,5,4)
and C(10,6,5), Discrete Mathematics 92 (1991) 6577

D.L. Kreher and S.P. Radziszowski,
Minimum TriangleFree Graphs,
Ars Combinatorica 31 (1991) 6592.

D. de Caen and D.L. Kreher,
The 3hypergraphical Steiner quadruple systems of order twenty,
in Graphs, Matrices and Designs
Ed. Rolf Rees,
Lecture Notes in Pure and Applied Mathematics 139 (1992)
8592.

T. Frenz and D.L. Kreher,
Enumerating Cyclic Steiner Systems,
in The Journal of Combinatorial Mathematics and Combinatorial Computing
11 (1992) 2332.

E.D. Billington and D.L. Kreher,
Yet another characterization of the Petersen Graph,
Bulletin of the Institute of Combinatorics and its Applications 7
(1993) 7377.

D.L. Kreher, D. de Caen, S.A. Hobart, E.S. Kramer and S. P. Radziszowski,
The Parameters 4(12,6,6) and Related tDesigns,
The Australasian Journal of Combinatorics 7 (1993) 320.

D.L. Kreher,
An infinite family of (simple) 6designs,
The Journal of Combinatorial Designs
1 No. 4 (1993) 277280.

Yeow Meng Chee and D.L. Kreher,
Simple 4(21,5, λ) Designs from the Frobenius Group of Order 171,
Ars Combinatoria 36 (1993) 199205.

D.G. Hoffman and D.L. Kreher,
The Bigraphical tWise Balanced Designs of Index One,
The Journal of Combinatorial Designs 2 (1994) 4148.

E.D. Boyer, D.L. Kreher, A. Sidorenko and S.P. Radziszowski,
On T(n,5,3)Turán Systems,
Ars Combinatoria
37 (1994) 119.

D.L. Kreher,
tDesigns With Large t: A Survey,
The Journal of Combinatorial Mathematics and Combinatorial Computing
15 (1994) 97110.
1995 to 1999

C.A. Cusack, D.L. Kreher and S.W. Graham,
Large sets of 3designs from PSL(2,q) with block sizes 4 and 5,
The Journal of Combinatorial Designs
3 (1995) 147160.

C.J. Colbourn, C.A. Cusack and D.L. Kreher,
Partial Steiner Triple Systems with EqualSized Holes,
The Journal of combinatorial Theory Series A
70 (1995) 5665.

L.M. Weiss and D.L. Kreher,
The Bigraphical tWise Balanced Designs of Index Two,
The Journal of Combinatorial Designs
3 (1995) 233255.

E.D. Billington and D.L. Kreher,
The intersection problem for small Gdesigns,
The Australasian Journal of Combinatorics
12 (1995) 239258.

D.L. Kreher,
Orthogonal arrays of strength 3,
the Journal of Combinatorial Designs
4 (1995).

M. Gilpin and D.L. Kreher,
A note on spanning trees in near dangulations.
Ars Combinatoria
41 (1995) 189192.

D.L. Kreher,
tDesigns, t ≥ 3,
The CRC handbook of combinatorial designs
C.J. Colbourn and J.H. Dinitz (Editors)
CRC Press, Boca Raton, 1996.

C.J. Colbourn and D.L. Kreher,
Concerning difference matrices,
Designs, Codes and Cryptography
9 6770 (1996).

D.L. Kreher, G.F. Royle and W.D. Wallis,
A Family of Resolvable Regular Graph Designs,
Discrete Mathematics 156 269275 (1996).

E.S. Kramer, D.L. Kreher and R. Mathon,
On Steiner 3wise balanced designs of order 17,
Journal of Combinatorial Designs
5 125145, (1997).

D.L. Kreher and D.R. Stinson,
Small group divisible designs with block size four,
Journal of Statistical Planning and Inference
58 111118, (1997).

D.L. Kreher, D.R. Stinson and L. Zhu,
On the maximum number of fixed points in automorphisms of 2(v,k,1) designs,
Annals of Combinatorics 1 (1997) 227243.

M.A. Chateauneuf, C.J. Colbourn and D.L.Kreher,
Covering arrays of strength 3,
Designs Codes and Cryptography 16 235242 (1999).

L. Burgess, D.L. Kreher and D.Street,
Small orthogonal main effect plans with four factors,
Communications in Statistics
28 Issue 10, 1999.

M.A. Chateauneuf, C.J. Colbourn,
D.L. Kreher, E.S. Lamkin and D.C. Torney,
Pooling, Lattice Square, and Union Jack Designs,
Annals of Combinatorics 3 (1999) 2735.
2000 to 2004

C.L. Olsen and D.L. Kreher,
Steiner graphical twise balanced designs of type n^{r} ,
Statistical Planning and Inference 86 (2000) 535566.

D.R. Stinson and D.L. Kreher
Pseudocode: A L^{A}T_{E}X Style File for Displaying Algorithms,
Bulletin of the institute of Combinatorics and its Applications
30 (2000) 1124.

D.L. Kreher, R.S. Rees,
A holesize bound for incomplete twise balanced designs,
The Journal of Combinatorial Designs 9 (2001) 269145.

D.L. Kreher,
United We Stand: A quick production of the American Flag
MUM 96 (March 2001) 1213.

D.L. Kreher, R.S. Rees,
On the maximum size of a hole in an incomplete twise balanced design
with specified minimum block size,
Ohio State Univ. Math. Res. Inst. Publ. 10 (2002) 179186.

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 twise balanced design
Journal of Combinatorial Designs 10 (2002) 256281,

M. Greig, D.L. Kreher, and A.C.H. Ling,
On PBIBD Designs Based on Triangular Schemes,
Ann. Comb. 6 (2002) 2, 147155.

M.A. Chateauneuf, and D.L. Kreher,
On the state of strengththree covering arrays,
Journal of Combinatorial Designs
10 (2002) no. 4, 217238.

C.J. Colbourn, D. L.Kreher, J. P. McSorley, and D.R. Stinson,
Orthogonal Arrays of Strength 3 from 3designs
Journal of Statistical Planning and Inference
100 (2002) no. 2, 191195.

D.L. Kreher, C.W.H. Lam, A.C.H. Ling, and R.S. Rees,
A note on {4}GDDs of type 2^{10},
Discrete Mathematics 261 (2003) 373376.

M.S. Keranen, D.L. Kreher, and P.J..S. Shiue,
The quadruple systems of the projective special linear group
PSL(2,q) q = 1 mod 4.
Journal of Combinatorial Designs
11 (2003) no. 5, 339351

M.S. Keranen, D.L. Kreher,
The 3designs of PSL(2,2^{n}) with block sizes 4 and 5
Journal of Combinatorial Designs
12 (2003) 103111.

D. Gronau, A.C.H. Ling and D.L. Kreher,
Super Simple (v,5,2)designs.
Discrete Applied Mathematics
138 (2004) 6577.

I. Adamczak, D.L. Kreher and R.S. Rees,
Tight Incomplete Block Designs,
Discrete Mathematics 284 (2004) 1120.
2005 to 2009

K.A. Lauinger, D.L. Kreher, R. Rees, and D.R. Stinson,
Computing transverse tdesigns,
Journal of Combinatorial Mathematics and Combinatorial Computing.
54 (2005), 3356.

B. Alspach, D. Dyer, D.L. Kreher,
On isomorphic factorizations Of circulant graphs,
Journal of Combinatorial Designs.
14 (2006), 406414.

Earl S. Kramer, D.L. Kreher,
tWise Balanced Designs, t ≥ 3,
The CRC handbook of combinatorial designs
C.J. Colbourn and J.H. Dinitz (Editors)
CRC Press, Boca Raton, 2007.

Y.M. Chee, D.L. Kreher,
Graphical Designs
The CRC handbook of combinatorial designs
C.J. Colbourn and J.H. Dinitz (Editors)
CRC Press, Boca Raton, 2007.

M.S. Keranen and D.L. Kreher,
Transverse quadruple systems with five holes,
Journal of Combinatorial Designs.
15, (2007), 315240.

L.R. Thimm, D.L. Kreher, and P.A., Merkey,
Parallel implementation for the maximum clique problem.
J. Combin. Math. Combin. Comput.
63 (2007), 183207.

A.A. Zhuralev, M.S. Keranen, and D.L. Kreher,
Small group divisible Steiner quadruple systems,
J. Combin. Math. Combin. Comput.,
15 (2008), #R40.

M.S. Keranen, and D.L. Kreher,
Correction to: Transverse quadruple systems with five holes.
J. Combin. Des.
17 (2009), no. 6, 492495.

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), 7173.

E.E. Westlund, J. Liu, Jiuqiang and D.L. Kreher,
6regular Cayley graphs on abelian groups of
odd order are Hamiltonian decomposable.
Discrete Math.
309 (2009), no. 16, 51065110.

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, 225230.
2010 to Present

D. L. Kreher and E. E. Westlund,
nisofactorizations of 8regular circulant graphs,
J. Combin. Math. Combin. Comput.
72 (2010) 197209.

M.S. Keranen, D.L. Kreher,S. Özkan,
Uniform twoclass regular partial Steiner triple systems.
J. Combin. Des.
20 (2012), no. 3, 161178.

B. Alspach, C. Caliskan and D.L. Kreher,
Orthogonal Projection and Liftings of
HamiltonDecomposable Cayley Graphs on Abelian Groups.
Discrete Math. 313 (2013), no. 13, 14751489.

B. Alspach, D. Bryant and D.L. Kreher,
VertexTransitive Graphs of PrimeSquared
Order Are HamiltonDecomposable.
J. Combin. Des.
22 (2014), no. 1, 1225.

C.J. Colbourn, M.S. Keranen, and D.L. Kreher,
fvectors of Pure Complexes and Pure Multicomplexes of Rank Three,
Discrete Mathematics 320 (2014), 2639.
Publications in Press
 W. L. Kocay and D. L. Kreher,
On Reconstructing Graphs and Their Complements
Submitted(Sept 28, 2012).

S. De Winter,
M.S. Keranen,
D.L. Kreher,
J. Nakamura,
and
Zeying Wang,
On a representation of integers,
Submitted (March 18, 2013)
Publications in preparation
 S. De Winter,
M.S. Keranen,
D.L. Kreher,
and
Zeying Wang,
On Hamilton Decompositions Of
Circulant Graphs Of prime cubed Order .
Books
 D.L. Kreher
and
D.R. Stinson,
Combinatorial Algorithms: Generation, Enumeration and Search,
CRC press LTC,
Boca Raton, Florida, 1998.

D.L. Kreher, W. Kocay, Graph Algorithms and Optimization
Chapman & Hall/CRC press,
Boca Raton, Florida, 2005.
Software Distribution
 D.L. Kreher and D.R. Stinson.
The CTAN
macros/latex/contrib/pseudocode/ directory,
Comprehensive TeX Archive Network,
January 14, 2005.
Invited Talks
 Algebraic Methods in the Theory of Combinatorial Designs.
 Drexel University, 1984.
 Lehigh University, 1984.
 University of Vermont, 1984.
 University of Southern Maine, 1984.
 Rochester Institute of Technology, 1984.
 Codes, Designs and Groups.
 Rochester Institute of Technology 1985.
 Search Algorithm for Ramsey Graphs.
 University of Nebraska, 1986.
 State University of New York at Oswego, 1986.
 Combinatorial Search Algorithms: A Demonstration.
 University of Vermont, 1987.
 Constructing 6(14,7,4) designs.
 University of Waterloo, Waterloo, Ontario, 1987.
 The 307th meeting of the American Mathematical Society,
University of Nebraska, Lincoln Nebraska, November 1987.
 Computing Combinatorial Configurations.
 3rd Ontario Combinatorics Workshop,
University of Waterloo, Waterloo, Ontario, 1987
 McMaster University, Hamilton Ontario, 1988.
 University of Wyoming, Laramie, Wyoming, 1988.
 Syracuse University, Syracuse, New York, 1988.
 Michigan Technological University, Houghton Michigan, 1991.
 University of West Virginia, Morgantown, West Virginia, 1991.
 A Design Theory Toolchest
 Eighteenth Annual Conference on Numerical Mathematics and Computing,
University of Manitoba, Winnipeg, Manitoba, September 1988.
 Institute for Mathematics and its Applications Workshops on Coding
Theory and Applications and on Design Theory and Applications,
University of Minnesota,
Minneapolis, Minnesota,
June 1225, 1988.
 Large Sets of Disjoint tDesigns
 The 859th meeting of the American Mathematical Society,
Columbus, Ohio, August 1990.
 The 97th Annual meeting of the American Mathematical Society,
San Francisco, California, January 1991.
 On Turán's Problem on Hypergraphs.
 University of Colorado, Denver, Colorado, December 1990.
 Auburn University , Auburn, Alabama , March 1991.
 University of Vermont, February 1999.
 tdesigns with Large t: A survey.
 The Seventh Midwestern Conference on Combinatorics, Cryptography and Computing, Carbondale, Illinois, October, 1992.
 Large sets of quadruple systems from PSL_{2}(q).
 Auburn University, Auburn, Alabama, March 1993.
 Large sets of 3designs from PSL(2,q), with block sizes 4 and 5,
 University of Nebraska, Lincoln, Nebraska, October 1993.
 Constructing tdesigns with t ≥ 3.
 Twenty sixth Southeastern International Conference on
Combinatorics, Graph Theory and Computing,
Boca Raton, Florida, March 1995.
 On Orthogonal Arrays of strength 3.
 The R.C. Bose memorial conference,
Ft. Collins, Colorado, June 1995.
 Hunting tDesigns with t > 3.
 The Twentysecond Australasian Conference on Combinatorial Mathematics
and Combinatorial Computing,
 Sydney, Australia, July, 1996.
University of Auckland, Auckland, New Zealand, July 1996.
 From tWise Balanced Designs to Orthogonal Arrays.
 Central Michigan University, Mt. Pleasant Michigan, January 1997.
 CRM Workshop on Transversal Designs and Orthogonal Arrays,
KitchenerWaterloo, Ontario, CANADA, April 1997.
 University of NevadaLas Vegas, Las Vegas, Nevada, February 2002.
 Covering arrays of strength 3.
 University of Nebraska, February 1998.
 University of Vermont, February 1998.
 Center for Nonlinear Research at Los Alamos, July 1998.
 Graphical Designs
 University of Vermont, February 1998.
 Computing Cliques
 University of Vermont, May 1998.
 University of Nebraska, May 1998.
 Rochester Institute of Technology, Sept 1999.
 Constructing Arrays
 Second Pythagorean Conference, An Advanced Research Workshop in Geometry,
Combinatorial Designs & Related Structures.
Pythagoreion, Samos, Greece, June 1999.
 Covering Arrays of Strength 3
 University of Rochester, Sept 1999.
 Rochester Institute of Technology, Sept 1999.
 A Holesize bound for incomplete twise balanced designs
 The XXVth Ohio StateDenison Mathematics Conference, May 2000.
 Optimal Discrete Structures and Algorithms  ODSA, Rostock (Germany),
September 2000.
 The Second Lethbridge Workshop onCryptography Designs, Codes, Cryptography and Graph Theory, June 2001.
 Magic Squares and Orthogonal Arrays
 University of NevadaLas Vegas, Las Vegas, Nevada, February 2002.
 University of Minnesota Duluth, Duluth, Minnesota, November 3, 2011
 Computing Transverse tDesigns
 First Prairie Discrete Mathematics Workshop
Regina, Saskatchewan, October 2003.
 Eighteen Midwestern Conference on Combinatorics, Cryptography and
Computing, Las Vegas, Nevada, October 2004.
 Isofactorizations of circulant graphs
 Fourth Prairie Discrete Mathematics Workshop
Lethbridge, Alberta, August 2006.
 The hypergraph degree sequence problem
 Thirty ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing,
Boca Raton, Florida, March 2008.
 Hamilton decomposition of circulant graphs of order p^{2}.
 University of Arizona, Tempe, Arizona, February 2013.
 VertexTransitive Graphs Of PrimeSquared Order Are HamiltonDecomposable.
 University of Minnesota Duluth, Duluth, Minnesota, May 2013.
 Groups Designs and Linear Algebra: Orbit incidence matrices.
 (3 lectures) University of Newcastle,
Newcastle, Australia, March 2012.
 (5 lectures)
CIMPA School ECOS 2013 held at National University of San Luis,
San Luis, Argentina, July 2013.
 The Degree Sequence Problem For Partial Steiner Triple Systems
 University Wisconsin
October 5, 2012
Contributed presentations at Conferences
 Thirteenth Southeastern International Conference on Combinatorics,
Graph Theory and Computing,
Boca Raton, Florida, February 1982.
 Fifteenth Southeastern International Conference on Combinatorics,
Graph Theory and Computing,
Baton Rouge, Louisiana, March 1984.
 Seventeenth Southeastern International Conference on Combinatorics,
Graph Theory and Computing,
Boca Raton, Florida, February 1986.
 Second Ontario Combinatorics Workshop,
McMaster University, Hamilton, Ontario, October 1986.
 Eighteenth Southeastern International Conference on Combinatorics,
Graph Theory and Computing,
Boca Raton, Florida, February 1987.
 Fifth Caribbean Conference on Combinatorics and Computing,
University of the West Indies, Cave Hill, Barbados, January 1988.
 Twentieth Southeastern International Conference on Combinatorics,
Graph Theory and Computing,
Boca Raton, Florida, February 1986.
 Third Vermont Combinatorics Workshop,
University of Vermont, Held in Stowe, Vermont, June 1989.
 Fifth Vermont Combinatorics Workshop,
University of Vermont, Held in Stowe, Vermont, June 1991.
 Sixth Midwestern Conference on Combinatorics, Computing and
Computing, Lincoln Nebraska, November 1991.
 Twenty Fourth Southeastern International Conference on
Combinatorics, Graph Theory and Computing,
Boca Raton, Florida, February 1993.
 Twenty Third Annual Conference on Numerical Mathematics and Computing,
University of Manitoba, Winnipeg, Manitoba, September 1993.

Twenty Fifth Southeastern International Conference on Combinatorics,
Graph Theory and Computing, September 1998.

Cryptology, Designs, and Finite Groups 2009 Conference. In
honor of Spyros Magliveras' 70th birthday. Dearfield Beach, Florida, May 1722, 2009.

The 35th Australasian Conference on Combinatorial Mathematics & Combinatorial Computing. 59 December 2011. Monash University, Melbourne, Australia.
Ph.D. students
 Cheryl L. Olson,
Ph.D. (Maths),
"On Graphical Designs",
University of NebraskaLincoln,
1997.
(cosupervised with E.S. Kramer.)

Mike Ira,
Ph.D. (Maths),
"TriGraphical Designs",
University of NebraskaLincoln,
(cosupervised with E.S. Kramer.)
2000.

Mark Chateauneuf,
Ph.D. (Maths),
"Covering arrays",
Michigan Technological University, 2000.

Izabela B. Adamczak,
Ph.D. (Maths),
"Tight Incomplete Block designs",
Michigan Technological University, 2002.

Melissa S. Keranen
Ph.D. (Maths),
"Transverse Steiner quadruple system",
Michigan Technological University, 2005.

Erik E. Westlund,
Ph.D. (Maths),
"Hamilton decompositions of 6regular Abelian Cayley Graphs
Michigan Technological University, 2010.
Master's students
 P. A. Eggleston,
M.S. (CS),
"Detection and Coding of Edges in Natural Scenes: Building a Fact Base for an Expert System",
1986.

R. E. Hill,
M.S. (CS),
"ACL: A Combinatorics Language",
1986.

R. T. Salamone,
M.S. (CS),
"An Implementation of the ChorRivest Knapsack Type Public Key Cryptosystem",
1986.

R. Nenno,
M.S. (CS),
"Nonlinear Errorcorrecting Codes",
1987.

Wei Li,
M.S. (CS),
"Algorithms for Constructing Multicolor Ramsey Graphs",
1987.

A. Stankus,
M.S. (CS),
"Implementing Ray Tracing with Techniques from Image Processing",
1987.

J. E. Robinson,
M.S. (CS),
"A Noiseless Data Compression Method Suitable for Inline Communication Channel Use",
1988.

S. Metha,
M.S. (CS),
"A WindowOriented UserInterface for Image Processing on Unix Based Workstations",
1988.

T. C. Frenz,
M.S. (CS),
"Computing Techniques for the Enumeration of Cyclic Steiner Systems",
1989.

N. M. Schornstein,
M.S. (CS),
"Computing the Chromatic Number of t(v,k,λ) Designs",
1989.

W. J. Monroe,
M.S. (CS),
"Computer Construction of (4,4,c)Threshold Schemes using Steiner Quadruple Systems",
1989.

C. A. Cusack,
M.S. (Maths),
"PSL(2,q) as an automorphism group of 3designs with blocksize 4",
1994.

L. M. Koehn,
M.S. (Maths),
"The Bigraphical tWise Balanced Designs of Index Two",
1994.

Jun Meng,
M.S. (Maths),
"Some new orthogonal arrays of strength 2",
1995.

Hrsito S. Sendov,
M.S. (Maths),
"A Graph Decomposition Theorem",
1996.

Melissa S. Keranen,
M.S. (Maths),
"An Infinite Class of Fibres In CURDs"
2002.

Kimberly Lauinger,
M.S. (Maths),
"Computing Transverse tdesigns"
2003.

Lisa Thimm,
M.S. (Maths)
"A Unified Parallel C Implementation for the Maximum Clique Problem",
2005

Erik E. Westlund,
M.S. (Maths),
"nIsofactorizations of Circulant Graphs",
2006

Artem Zurhalev,
M.S. (Maths)
"Group Divisible Steiner Quadruple Systems",
2007.