Jeffrey H. Dinitz - Concepedia

Author

Jeffrey H. Dinitz

Also Known As

Dalibor Froncek, Dinitz, J. H., Dinitz, Jeffrey, Dinitz, Jeffrey H., Dinitz, Jeffrey. H., J Dinitz, J. Dinitz, J. H. Dinitz, J.H Dinitz, J.H. Dinitz

Publications

2.4K

Citations

H-Index

Concepts

All Affiliations

University of Vermont University of Waterloo University of Victoria Bowdoin College The Ohio State University

About

Jeffrey H. Dinitz is an author at University of Vermont specializing in discrete mathematics, engineering, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	12	308
2	Computer Science	4	4	98
3	Social Sciences	3	3	43
4	Education	2	2	83
5	Geography	2	2	30

Jeffrey H. Dinitz

Publications

939

Citations

H-Index

Page 1

	Year	Citations
The CRC Handbook of Combinatorial Designs RVL, Charles J. Colbourne, Jeffrey H. Dinitz Journal of the American Statistical Association Crc HandbookDesignCombinatorial DesignCombinatorial Design TheoryDiscrete Mathematics	1997	145
Mutually orthogonal latin squares (MOLS) Ryan Julian, R. Julian R. Abel, Charles J. Colbourn, Combinatorics On WordDiscrete MathematicsComputer AlgebraMatrix Theory	2006	116
Mutually orthogonal latin squares: a brief survey of constructions Charles J. Colbourn, Jeffrey H. Dinitz Journal of Statistical Planning and Inference Mathematical ProgrammingCombinatorics On WordComputer AlgebraBrief SurveyCombinatorial Design Theory	2001	70
On the irregularity strength of the <i>m</i> × <i>n</i> grid Jeffrey H. Dinitz, David K. Garnick, András Gyárfás Journal of Graph Theory Discrete GeometryNetwork ScienceGraph TheoryEngineeringAlgebraic Graph Theory	1992	48
There are 526,915,620 nonisomorphic one‐factorizations of K<sub>12</sub> Jeffrey H. Dinitz, David K. Garnick, Brendan D. McKay Journal of Combinatorial Designs Geometry Of Number© 1994Computational Number TheoryK 12Distinct One‐factorizations	1994	45
Bicoloring Steiner Triple Systems Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa The Electronic Journal of Combinatorics EngineeringGraph TheoryColor ReproductionColorizationOptical Properties	1999	43
Mols with holes Jeffrey H. Dinitz, Douglas R. Stinson Discrete Mathematics Block DesignDiscrete MathematicsSpecification (Technical Standard)	1983	41
Square integer Heffter arrays with empty cells Dan Archdeacon, Jeffrey H. Dinitz, Diane Donovan, Designs Codes and Cryptography Array ComputingSquare Integer Heffter	2015	40
Tight Heffter Arrays Exist for all Possible Values Dan Archdeacon, Tomas Boothby, Jeffrey H. Dinitz Journal of Combinatorial Designs Integer Heffter ArraysInteger Heffter ArrayEngineeringComputational Complexity TheoryArray Computing	2016	36
The Hamilton—Waterloo problem: The case of triangle‐factors and one Hamilton cycle Jeffrey H. Dinitz, Alan C. H. Ling Journal of Combinatorial Designs Hamiltonian TheoryGeometryK 2Combinatorial DesignHamilton—waterloo Problem	2008	35

Page 1