J. Dinitz

发表

The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC).

C. Colbourn, J. Dinitz, Norman Biggs, 1997, The Mathematical Gazette.

Handbook of Combinatorial Designs

C. Colbourn, J. Dinitz, 2006 .

Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking

Douglas R Stinson, C. Colbourn, J. Dinitz, 1999 .

CORR 99-01 Applications of Combinatorial Designs to Communications , Cryptography , and Networking

C. Colbourn, J. Dinitz, D. Stinson, 1999 .

Making the Mols Table

C. Colbourn, J. Dinitz, 1996 .

Contemporary design theory : a collection of surveys

Douglas R Stinson, J. Dinitz, D. Stinson, 1992 .

Mutually orthogonal latin squares (MOLS)

C. Colbourn, J. Dinitz, R. Abel, 2006 .

A Fast Algorithm for Finding Strong Starters

Douglas R. Stinson, J. H. Dinitz, J. Dinitz, 1981 .

Some new perfect one-factorizations from starters in finite fields

Douglas R. Stinson, Jeffrey H. Dinitz, J. Dinitz, 1989, J. Graph Theory.

On nonisomorphic Room squares

J. Dinitz, D. Stinson, 1983 .

On Partial Sums in Cyclic Groups

J. H. Dinitz, J. Dinitz, D. Stinson, 2015, 1501.06872.

Room square patterns

J. Dinitz, E. Lamken, 2000 .

Number Theory and Finite Fields

H. C. Williams, J. Dinitz, H. Williams, 2006 .

Other combinatorial structures

Jeffrey H. Dinitz, Charles J. Colbourn, C. Colbourn, 2013, Handbook of Finite Fields.

Preface

Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek, 2003, Discret. Math..

Charles J. Colbourn, Jeffrey H. Dinitz, C. Colbourn, 1996, DMTCS.

Other Combinatorial Designs

David Coudert, Akihiro Munemasa, Li, 2006 .

Two new infinite families of extremal class‐uniformly resolvable designs

J. Dinitz, A. Ling, 2008 .

Fault‐tolerant routings with minimum optical index

Alan C. H. Ling, Douglas R. Stinson, Jeffrey H. Dinitz, 2006, Networks.

Sequentially Perfect and Uniform One-Factorizations of the Complete Graph

Douglas R. Stinson, Peter Dukes, Jeffrey H. Dinitz, 2005, Electron. J. Comb..

Mutually orthogonal latin squares: a brief survey of constructions

Charles J. Colbourn, Jeffrey H. Dinitz, C. Colbourn, 2001 .

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Charles J. Colbourn, Jeffrey H. Dinitz, C. Colbourn, 2006 .

Block-transitive designs

Charles J. Colbourn, Jeffrey H. Dinitz, Anne Delandtsheer, 2006 .

On the maximum number of different ordered pairs of symbols in sets of latin squares

J. Dinitz, D. Stinson, 2005 .

Design Theory: Antiquity to 1950

Charles J. Colbourn, Terry S. Griggs, Jeffrey H. Dinitz, 2006 .

There are 23 nonisomorphic perfect one-factorizations ofK14

J. Dinitz, D. K. Garnick, 1996 .

N ( n ) and ν ( n ) : Similarities and Differences

C. Colbourn, J. Dinitz, 2017 .

A survey of Heffter arrays

J. Dinitz, A. Pasotti, 2022, 2209.13879.

CORR 99-01 Applications of Combinatorial Designs to Communications , Cryptography , and Networking

Douglas R Stinson, C. Colbourn, J. Dinitz, 1999 .

Generating sets in Steiner triple systems

C. Colbourn, J. Dinitz, 2000 .

Complete Arcs in Steiner Triple Systems

Charles J. Colbourn, Jeffrey H. Dinitz, C. Colbourn, 1997, J. Comb. Theory, Ser. A.

A Singular Direct Product for Bicolorable Steiner Triple Systems

J. Dinitz, D. Stinson, 2010 .

Bicoloring Steiner Triple Systems

Charles J. Colbourn, Alexander Rosa, Jeffrey H. Dinitz, 1999, Electron. J. Comb..

Combinatorial Designs

C. Colbourn, J. Dinitz, 1999, Handbook of Discrete and Combinatorial Mathematics.

An Analysis of $N\!K$ Landscapes: Interaction Structure, Statistical Properties, and Expected Number of Local Optima

Jeffrey S. Buzas, Jeffrey H. Dinitz, J. Dinitz, 2014, IEEE Transactions on Evolutionary Computation.

An analysis of NK and generalized NK landscapes pdf

Jeffrey S. Buzas, Jeffrey H. Dinitz, J. Dinitz, 2013, ArXiv.

Indecomposable triple systems exist for all lambda

Jeffrey H. Dinitz, Dan Archdeacon, J. Dinitz, 1993, Discret. Math..

Spanning sets and scattering sets in Steiner triple systems

Charles J. Colbourn, Douglas R. Stinson, Jeffrey H. Dinitz, 1991, J. Comb. Theory, Ser. A.

Estimating landscape carrying capacity through maximum clique analysis.

J. Dinitz, T. Donovan, W. Schwenk, 2012, Ecological applications : a publication of the Ecological Society of America.

Some New Row-Complete Latin Squares

Douglas R. Stinson, Jeffrey H. Dinitz, Dan Archdeacon, 1980, J. Comb. Theory, Ser. A.

The existence of room 5-cubes

Jeffrey H. Dinitz, J. Dinitz, 1987, J. Comb. Theory, Ser. A.

Orthogonal one-factorization graphs

Jeffrey H. Dinitz, J. Dinitz, 1985, J. Graph Theory.

The Spectrum of Room Cubes

Douglas R. Stinson, Jeffrey H. Dinitz, Douglas R Stinson, 1981, Eur. J. Comb..

Room squares with holes of sides 3, 5, and 7

Douglas R. Stinson, Walter D. Wallis, Jeffrey H. Dinitz, 1983, Discret. Math..

The Hamilton—Waterloo problem: The case of triangle‐factors and one Hamilton cycle

Alan C. H. Ling, Jeffrey H. Dinitz, J. Dinitz, 2009 .

Sets of three pairwise orthogonal Steiner triple systems

Alan C. H. Ling, Peter Dukes, Jeffrey H. Dinitz, 2003, J. Comb. Theory, Ser. A.

Handbook of Combinatorial Designs

C. Colbourn, J. Dinitz, 2006 .

Complementary partial resolution squares for Steiner triple systems

Alan C. H. Ling, Jeffrey H. Dinitz, Esther R. Lamken, 2003, Discret. Math..

More Thwarts in Transversal Designs

Charles J. Colbourn, Douglas R. Stinson, Jeffrey H. Dinitz, 1996 .

Thwarts in transversal designs

Charles J. Colbourn, Jeffrey H. Dinitz, Mieczyslaw Wojtas, 1995, Des. Codes Cryptogr..

Disjoint Difference Families with Block Size 3

J. H. Dinitz, J. Dinitz, 2013 .

Combinatorial Designs

C. Colbourn, J. Dinitz, 1999, Handbook of Discrete and Combinatorial Mathematics.

Heuristic Algorithms for Finding Irregularity Strengths of Graphs

David K. Garnick, Jeffrey H. Dinitz, J. Dinitz, 2022 .

Scheduling a Tournament

Walter D. Wallis, Jeffrey H. Dinitz, Dalibor Froncek, 2006 .

Handbook Of Applied Cryptography Crc Press

Alfred Menezes, Jeffrey H. Dinitz, Alexander V. Sergienko, 2015 .

There are 526,915,620 nonisomorphic one‐factorizations of K12

Brendan D. McKay, David K. Garnick, Jeffrey H. Dinitz, 1994 .

On the number of one-factorizations of the complete graph on 12 points

J. H. Dinitz, J. Dinitz, D. K. Garnick, 2017 .

Holey factorizations

David K. Garnick, Jeffrey H. Dinitz, J. Dinitz, 1996, Ars Comb..

Four Orthogonal One-Factorizations on Ten Points

J. H. Dinitz, J. Dinitz, W. D. Wallia, 1985 .