Jeff Dinitz

Q: What Schools Are Affiliated With Jeff Dinitz

Jeff Dinitz is affiliated with the following schools: University of Vermont, Ohio State University, Carnegie Mellon University

Jeff Dinitz's AcademicInfluence.com Rankings

Jeff Dinitz

Mathematics

#2196

World Rank

#3428

Historical Rank

#875

USA Rank

Combinatorics

#26

World Rank

#30

Historical Rank

USA Rank

Measure Theory

#3320

World Rank

#3923

Historical Rank

#958

USA Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Jeff Dinitz Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jeffrey Howard Dinitz is an American mathematician who taught combinatorics at the University of Vermont. He is best known for proposing the Dinitz conjecture, which became a major theorem. Early life and education Dinitz was born in 1952 in Brooklyn, New York City, New York.

(See a Problem?)

Jeff Dinitz's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

CRC Handbook of Combinatorial Designs (1996) (1675)
Handbook of Combinatorial Designs (2006) (949)
Contemporary design theory : a collection of surveys (1992) (570)
Mutually orthogonal latin squares (MOLS) (2006) (150)
Handbook Of Applied Cryptography Crc Press (2015) (134)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications) (2006) (131)
Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking (1999) (125)
Combinatorial Designs (1999) (101)
CORR 99-01 Applications of Combinatorial Designs to Communications , Cryptography , and Networking (1999) (77)
Mutually orthogonal latin squares: a brief survey of constructions (2001) (66)
There are 526,915,620 nonisomorphic one‐factorizations of K12 (1994) (56)
On the irregularity strength of the m × n grid (1992) (50)
Bicoloring Steiner Triple Systems (1999) (45)
Scheduling a Tournament (2006) (45)
Mols with holes (1983) (44)
Square integer Heffter arrays with empty cells (2014) (37)
Making the Mols Table (1996) (35)
Tight Heffter Arrays Exist for all Possible Values (2015) (34)
Some new perfect one-factorizations from starters in finite fields (1989) (34)
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph (2005) (32)
The existence of square integer Heffter arrays (2017) (31)
A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares (1987) (30)
Biembedding Steiner triple systems and n-cycle systems on orientable surfaces (2015) (30)
The Hamilton—Waterloo problem: The case of triangle‐factors and one Hamilton cycle (2009) (30)
The Spectrum of Room Cubes (1981) (30)
On Partial Sums in Cyclic Groups (2015) (29)
Room n-cubes of lowe order (1984) (27)
A Fast Algorithm for Finding Strong Starters (1981) (25)
Block disjoint difference families for Steiner triple systems (2002) (20)
An Analysis of $N\!K$ Landscapes: Interaction Structure, Statistical Properties, and Expected Number of Local Optima (2014) (19)
Some New Row-Complete Latin Squares (1980) (18)
On the structure of uniform one-factorizations from starters in finite fields (2006) (18)
Lower bounds for the number of pairwise orthogonal symmetric Latin squares (1980) (17)
The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles: The case n 3 (mod 18) (2008) (17)
Disjoint Difference Families with Block Size 3 (2013) (16)
Cycle systems in the complete bipartite graph minus a one-factor (2004) (16)
Estimating landscape carrying capacity through maximum clique analysis. (2012) (15)
Thwarts in transversal designs (1995) (14)
Quorum Systems Constructed from Combinatorial Designs (2001) (13)
The stipulation polynomial of a uniquely list-colorable graph (1995) (12)
Indecomposable triple systems exist for all lambda (1993) (9)
Constructing indecomposable 1-factorizations of the complete multigraph (1991) (9)
On the Spectra of Certain Classes of Room Frames (1994) (8)
Translational hulls and block designs (1983) (8)
There are 23 nonisomorphic perfect one-factorizations ofK14 (1996) (8)
Spanning sets and scattering sets in Steiner triple systems (1991) (8)
Four Orthogonal One-Factorizations on Ten Points (1985) (7)
Uniform Room Frames with Five Holes (1993) (7)
Perfect hash families from transversal designs (2007) (7)
Howell Designs with Sub-designs (1994) (6)
More Thwarts in Transversal Designs (1996) (6)
The Spectra of Certain Classes of Room Frames: The Last Cases (2010) (6)
The existence of room 5-cubes (1987) (6)
Fault-tolerant routings with minimum optical index (2006) (6)
Winning the Lottery (1996) (5)
Design Theory: Antiquity to 1950 (2006) (5)
Heuristic Algorithms for Finding Irregularity Strengths of Graphs (4)
Constructions for retransmission permutation arrays (2012) (4)
Fault‐tolerant routings with minimum optical index (2006) (3)
HOPs and COPs: Room frames with partitionable transversals (2000) (3)
Number Theory and Finite Fields (2006) (3)
A survey of Heffter arrays (2022) (3)
On orthogonal generalized equitable rectangles (2009) (3)
Sets of three pairwise orthogonal Steiner triple systems (2003) (2)
A Few More Room Frames (2017) (2)
Packing Costas Arrays (2011) (2)
The Existence of N2 Resolvable Latin Squares (2009) (2)
Room squares with holes of sides 3, 5, and 7 (1983) (2)
Generating sets in Steiner triple systems (2000) (2)
Orthogonal one-factorization graphs (1985) (2)
On the number of one-factorizations of the complete graph on 12 points (2017) (1)
Complete Arcs in Steiner Triple Systems (1997) (1)
On nonisomorphic Room squares (1983) (1)
On the existence of three dimensional Room frames and Howell cubes (2013) (1)
Block-transitive designs (2006) (1)
Complementary partial resolution squares for Steiner triple systems (2003) (1)
An analysis of NK and generalized NK landscapes (2013) (1)
Two new infinite families of extremal class‐uniformly resolvable designs (2008) (1)
Other Combinatorial Designs (2006) (1)
Other Combinatorial Designs (2006) (1)
On the maximum number of different ordered pairs of symbols in sets of latin squares (2005) (1)
New lower bounds on the maximum number of mutually orthogonal Steiner triple systems (2003) (1)
Almost Resolvable Max Packings / Min Coverings Of K n With 4-Cycles (2009) (0)
On Maximal Partial Costas Latin Squares (2013) (0)
Block designs (2013) (0)
ROOM /j-CUBES OF LOW ORDER (2008) (0)
Square integer Heffter arrays with empty cells (2015) (0)
ROOM /j-CUBES OF LOW ORDER (2008) (0)
The existence of referee squares (2001) (0)
MOL ! SWITHH (2001) (0)
N ( n ) and ν ( n ) : Similarities and Differences (2017) (0)
Preface (2009) (0)
Special issue in honour of Dan S. Archdeacon: Guest Editorial (2017) (0)
A Singular Direct Product for Bicolorable Steiner Triple Systems (2010) (0)
Seeds for Generalized Taxicab Numbers (2019) (0)
Holey factorizations (1996) (0)
Constructions for retransmission permutation arrays (2012) (0)
Room square patterns (2000) (0)
Other combinatorial structures (2013) (0)
N(n), v(n): Similarities and Differences (1996) (0)
Preface (2003) (0)

This paper list is powered by the following services:

Other Resources About Jeff Dinitz

en.wikipedia.org

What Schools Are Affiliated With Jeff Dinitz?

Jeff Dinitz is affiliated with the following schools:

Jeff Dinitz's Academic­Influence.com Rankings

Why Is Jeff Dinitz Influential?

Jeff Dinitz's Published Works

Published Works

Other Resources About Jeff Dinitz

What Schools Are Affiliated With Jeff Dinitz?

Jeff Dinitz's AcademicInfluence.com Rankings