J. H. Dinitz

From MaRDI portal
Person:184638

Available identifiers

zbMath Open dinitz.jeffrey-hDBLP50/900WikidataQ11007940 ScholiaQ11007940MaRDI QIDQ184638

List of research outcomes





PublicationDate of PublicationType
A survey of Heffter arrays2024-10-02Paper
A survey of Heffter arrays2022-09-28Paper
Seeds for Generalized Taxicab Numbers2019-05-20Paper
The existence of square integer Heffter arrays2017-12-13Paper
Biembedding Steiner Triple Systems and n-cycle Systems on Orientable Surfaces2017-11-29Paper
Tight Heffter Arrays Exist for all Possible Values2017-05-23Paper
On Partial Sums in Cyclic Groups2016-12-20Paper
Square integer Heffter arrays with empty cells2015-10-26Paper
https://portal.mardi4nfdi.de/entity/Q55003012015-08-05Paper
On the existence of three dimensional room frames and Howell cubes2014-01-20Paper
Constructions for retransmission permutation arrays2012-11-28Paper
Packing Costas arrays2012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q35825232010-09-02Paper
The Existence of $N_2$ Resolvable Latin Squares2010-08-27Paper
https://portal.mardi4nfdi.de/entity/Q35677952010-06-17Paper
The spectra of certain classes of room frames: the last cases2010-06-16Paper
Maximum uniformly resolvable designs with block sizes 2 and 42009-12-15Paper
The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle2009-04-08Paper
On orthogonal generalized equitable rectangles2009-03-31Paper
Two new infinite families of extremal class-uniformly resolvable designs2008-06-05Paper
Perfect hash families from transversal designs2007-07-26Paper
https://portal.mardi4nfdi.de/entity/Q34247122007-03-05Paper
Fault‐tolerant routings with minimum optical index2006-09-12Paper
On the structure of uniform one-factorizations from starters in finite fields2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q30236562005-07-05Paper
https://portal.mardi4nfdi.de/entity/Q46819822005-06-09Paper
Sequentially perfect and uniform one-factorizations of the complete graph2005-04-25Paper
On the maximum number of different ordered pairs of symbols in sets of latin squares2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q31551502005-01-14Paper
Cycle systems in the complete bipartite graph minus a one-factor2004-08-20Paper
https://portal.mardi4nfdi.de/entity/Q47933122003-07-29Paper
Sets of three pairwise orthogonal Steiner triple systems2003-03-26Paper
Complementary partial resolution squares for Steiner triple systems2003-03-16Paper
Quorum systems constructed from combinatorial designs2003-01-14Paper
Block disjoint difference families for Steiner triple systems: \(v\equiv 3 \mod 6\)2002-09-18Paper
The existence of referee squares2002-05-02Paper
Generating sets in Steiner triple systems2002-03-07Paper
Mutually orthogonal Latin squares: A brief survey of constructions2002-01-02Paper
https://portal.mardi4nfdi.de/entity/Q42636582001-11-22Paper
Scheduling the XFL2001-10-15Paper
Room square patterns2001-09-13Paper
Combinatorics in undergraduate courses2001-07-29Paper
HOPs and COPs: Room frames with partitionable transversals2001-01-14Paper
Bicoloring Steiner triple systems1999-06-20Paper
https://portal.mardi4nfdi.de/entity/Q42218971999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q42175791998-11-11Paper
https://portal.mardi4nfdi.de/entity/Q43781801998-07-27Paper
https://portal.mardi4nfdi.de/entity/Q43882001998-05-17Paper
More thwarts in transversal designs1998-04-26Paper
Complete arcs in Steiner triple systems1998-04-01Paper
Uniform room frames with five holes1998-02-11Paper
https://portal.mardi4nfdi.de/entity/Q48842151997-02-17Paper
https://portal.mardi4nfdi.de/entity/Q48769761996-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48769291996-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48769991996-11-03Paper
https://portal.mardi4nfdi.de/entity/Q48769631996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48769821996-08-20Paper
https://portal.mardi4nfdi.de/entity/Q48769281996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48769271996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48769851996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48427151995-11-26Paper
There are 526,915,620 nonisomorphic one‐factorizations of K121995-05-04Paper
Thwarts in transversal designs1995-05-04Paper
On the sprectra of certain classes of Room frames1995-04-06Paper
https://portal.mardi4nfdi.de/entity/Q43018911994-09-29Paper
Howell designs with sub-designs1994-09-11Paper
Indecomposable triple systems exist for all lambda1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40261471993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40261431993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q31369881993-01-01Paper
On the irregularity strength of them ×n grid1992-10-05Paper
https://portal.mardi4nfdi.de/entity/Q40007791992-09-26Paper
Constructing indecomposable 1-factorizations of the complete multigraph1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39805641992-06-26Paper
Spanning sets and scattering sets in Steiner triple systems1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34873541990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34873881990-01-01Paper
Some new perfect one-factorizations from starters in finite fields1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38354611989-01-01Paper
The existence of Room 5-cubes1987-01-01Paper
A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817631987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37986991987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588491985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36988341985-01-01Paper
Orthogonal one-factorization graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935341985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33239681984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808691984-01-01Paper
Mols with holes1983-01-01Paper
Room squares with holes of sides 3, 5, and 71983-01-01Paper
On Nonisomorphic Room Squares1983-01-01Paper
Translational hulls and block designs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36615871982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39689371982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47428001982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39367461981-01-01Paper
The spectrum of Room cubes1981-01-01Paper
A Fast Algorithm for Finding Strong Starters1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39645821981-01-01Paper
The spectrum of room cubes1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38985081980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39126021980-01-01Paper
Some new row-complete latin squares1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38939401980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38661321979-01-01Paper

Research outcomes over time

This page was built for person: J. H. Dinitz