Some New Row-Complete Latin Squares. - Dan Archdeacon; Jeffrey H. Dinitz; Douglas R. Stinson; Timothy W. Tillson (J. Comb. Theory A, 1980)

The Spectrum of Room Cubes. - Jeffrey H. Dinitz; Douglas R. Stinson (Eur. J. Comb., 1981)

Mols with holes. - Jeffrey H. Dinitz; Douglas R. Stinson (Discret. Math., 1983)

Room squares with holes of sides 3, 5, and 7. - Jeffrey H. Dinitz; Douglas R. Stinson; W. D. Wallis (Discret. Math., 1983)

Orthogonal one-factorization graphs. - Jeffrey H. Dinitz (J. Graph Theory, 1985)

The existence of room 5-cubes. - Jeffrey H. Dinitz (J. Comb. Theory A, 1987)

Some new perfect one-factorizations from starters in finite fields. - Jeffrey H. Dinitz; Douglas R. Stinson (J. Graph Theory, 1989)

Constructing indecomposable 1-factorizations of the complete multigraph. - Dan Archdeacon; Jeffrey H. Dinitz (Discret. Math., 1991)

Spanning sets and scattering sets in Steiner triple systems. - Charles J. Colbourn; Jeffrey H. Dinitz; Douglas R. Stinson (J. Comb. Theory A, 1991)

On the irregularity strength of the m × n grid. - Jeffrey H. Dinitz; David K. Garnick; András Gyárfás (J. Graph Theory, 1992)

Indecomposable triple systems exist for all lambda. - Dan Archdeacon; Jeffrey H. Dinitz (Discret. Math., 1993)

On the Spectra of Certain Classes of Room Frames. - Jeffrey H. Dinitz; Douglas R. Stinson; Lie Zhu (Electron. J. Comb., 1994)

Howell Designs with Sub-designs. - Jeffrey H. Dinitz; Esther R. Lamken (J. Comb. Theory A, 1994)

The stipulation polynomial of a uniquely list-colorable graph. - Jeffrey H. Dinitz; W. J. Martin (Australas. J Comb., 1995)

Thwarts in Transversal Designs. - Charles J. Colbourn; Jeffrey H. Dinitz; Mieczyslaw Wojtas (Des. Codes Cryptogr., 1995)

N(n), v(n): Similarities and Differences. - Charles J. Colbourn; Jeffrey H. Dinitz (DMTCS, 1996)

Holey factorizations. - Jeffrey H. Dinitz; David K. Garnick (Ars Comb., 1996)

Complete Arcs in Steiner Triple Systems. - Charles J. Colbourn; Jeffrey H. Dinitz (J. Comb. Theory A, 1997)

Bicoloring Steiner Triple Systems. - Charles J. Colbourn; Jeffrey H. Dinitz; Alexander Rosa (Electron. J. Comb., 1999)

Combinatorial Designs. - Charles J. Colbourn; Jeffrey H. Dinitz (Handbook of Discrete and Combinatorial Mathematics, 1999)

HOPs and COPs: Room frames with partitionable transversals. - Jeffrey H. Dinitz; Esther R. Lamken (Des. Codes Cryptogr., 2000)

The existence of referee squares. - Jeffrey H. Dinitz; Alan C. H. Ling (Discret. Math., 2001)

Quorum Systems Constructed from Combinatorial Designs. - Charles J. Colbourn; Jeffrey H. Dinitz; Douglas R. Stinson (Inf. Comput., 2001)

Preface. - Charles J. Colbourn; Jeffrey H. Dinitz; Dalibor Froncek (Discret. Math., 2003)

Complementary partial resolution squares for Steiner triple systems. - Jeffrey H. Dinitz; Esther R. Lamken; Alan C. H. Ling (Discret. Math., 2003)

Sets of three pairwise orthogonal Steiner triple systems. - Jeffrey H. Dinitz; Peter Dukes; Alan C. H. Ling (J. Comb. Theory A, 2003)

Cycle systems in the complete bipartite graph minus a one-factor. - Dan Archdeacon; Marisa Debowsky; Jeffrey H. Dinitz; Heather Gavlas (Discret. Math., 2004)

Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. - Jeffrey H. Dinitz; Peter Dukes; Douglas R. Stinson (Electron. J. Comb., 2005)

On the structure of uniform one-factorizations from starters in finite fields. - Jeffrey H. Dinitz; Peter Dukes (Finite Fields Their Appl., 2006)

Fault-tolerant routings with minimum optical index. - Jeffrey H. Dinitz; Alan C. H. Ling; Douglas R. Stinson (Networks, 2006)

Perfect hash families from transversal designs. - Jeffrey H. Dinitz; Alan C. H. Ling; Douglas R. Stinson (Australas. J Comb., 2007)

On orthogonal generalized equitable rectangles. - Haitao Cao 001; Jeffrey H. Dinitz; Donald L. Kreher; Douglas R. Stinson; Ruizhong Wei (Des. Codes Cryptogr., 2009)

Preface. - Jeffrey H. Dinitz; Hadi Kharaghani; Gholamreza B. Khosrovshahi; Shahriar Shahriari (Discret. Math., 2009)

Maximum uniformly resolvable designs with block sizes 2 and 4. - Jeffrey H. Dinitz; Alan C. H. Ling; Peter Danziger (Discret. Math., 2009)

The Existence of N2 Resolvable Latin Squares. - A. J. Wolfe; Alan C. H. Ling; Jeffrey H. Dinitz (SIAM J. Discret. Math., 2009)

The Spectra of Certain Classes of Room Frames: The Last Cases. - Jeffrey H. Dinitz; Gregory S. Warrington (Electron. J. Comb., 2010)

Constructions for retransmission permutation arrays. - Jeffrey H. Dinitz; Maura B. Paterson; Douglas R. Stinson; Ruizhong Wei (Des. Codes Cryptogr., 2012)

Block designs. - Charles J. Colbourn; Jeffrey H. Dinitz (Handbook of Finite Fields, 2013)

Other combinatorial structures. - Jeffrey H. Dinitz; Charles J. Colbourn (Handbook of Finite Fields, 2013)

An analysis of NK and generalized NK landscapes - Jeffrey S. Buzas; Jeffrey H. Dinitz (CoRR, 2013)

On the existence of three dimensional Room frames and Howell cubes. - Jeffrey H. Dinitz; Esther R. Lamken; Gregory S. Warrington (Discret. Math., 2013)

An Analysis of N !K Landscapes: Interaction Structure, Statistical Properties, and Expected Number of Local Optima. - Jeffrey S. Buzas; Jeffrey H. Dinitz (IEEE Trans. Evol. Comput., 2014)

Square integer Heffter arrays with empty cells. - Dan Archdeacon; Jeffrey H. Dinitz; Diane M. Donovan; Emine Sule Yazici (Des. Codes Cryptogr., 2015)

Special issue in honour of Dan S. Archdeacon: Guest Editorial. - C. Paul Bonnington; Jeffrey H. Dinitz; Jozef Sirán (Australas. J Comb., 2017)

Biembedding Steiner triple systems and n-cycle systems on orientable surfaces. - Jeffrey H. Dinitz; Amelia R. W. Mattern (Australas. J Comb., 2017)

The existence of square integer Heffter arrays. - Jeffrey H. Dinitz; Ian M. Wanless (Ars Math. Contemp., 2017)

Seeds for Generalized Taxicab Numbers. - Jeffrey H. Dinitz; Richard A. Games; Robert L. Roth (J. Integer Seq., 2019)