default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey H. Dinitz
Person information
- affiliation: University of Vermont, Department of Mathematics and Statistics, Burlington, VT, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j42]Jeffrey H. Dinitz, Richard A. Games, Robert L. Roth:
Seeds for Generalized Taxicab Numbers. J. Integer Seq. 22(3): 19.3.3 (2019)- 2017
- [j41]C. Paul Bonnington, Jeffrey H. Dinitz, Jozef Sirán:
Special issue in honour of Dan S. Archdeacon: Guest Editorial. Australas. J Comb. 67: 65-76 (2017) - [j40]Jeffrey H. Dinitz, Amelia R. W. Mattern:
Biembedding Steiner triple systems and n-cycle systems on orientable surfaces. Australas. J Comb. 67: 327-344 (2017) - [j39]Jeffrey H. Dinitz, Ian M. Wanless:
The existence of square integer Heffter arrays. Ars Math. Contemp. 13(1): 81-93 (2017) - 2015
- [j38]Dan Archdeacon, Jeffrey H. Dinitz, Diane M. Donovan
, Emine Sule Yazici:
Square integer Heffter arrays with empty cells. Des. Codes Cryptogr. 77(2-3): 409-426 (2015) - 2014
- [j37]Jeffrey S. Buzas, Jeffrey H. Dinitz:
An Analysis of N\!K Landscapes: Interaction Structure, Statistical Properties, and Expected Number of Local Optima. IEEE Trans. Evol. Comput. 18(6): 807-818 (2014) - 2013
- [j36]Jeffrey H. Dinitz, Esther R. Lamken, Gregory S. Warrington:
On the existence of three dimensional Room frames and Howell cubes. Discret. Math. 313(11): 1368-1384 (2013) - [p2]Charles J. Colbourn, Jeffrey H. Dinitz:
Block designs. Handbook of Finite Fields 2013: 589-598 - [p1]Jeffrey H. Dinitz, Charles J. Colbourn:
Other combinatorial structures. Handbook of Finite Fields 2013: 607-618 - [i1]Jeffrey S. Buzas, Jeffrey H. Dinitz:
An analysis of NK and generalized NK landscapes. CoRR abs/1302.3541 (2013) - 2012
- [j35]Jeffrey H. Dinitz, Maura B. Paterson, Douglas R. Stinson, Ruizhong Wei:
Constructions for retransmission permutation arrays. Des. Codes Cryptogr. 65(3): 325-351 (2012) - 2010
- [j34]Jeffrey H. Dinitz, Gregory S. Warrington:
The Spectra of Certain Classes of Room Frames: The Last Cases. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j33]Haitao Cao, Jeffrey H. Dinitz, Donald L. Kreher, Douglas R. Stinson, Ruizhong Wei:
On orthogonal generalized equitable rectangles. Des. Codes Cryptogr. 51(3): 225-230 (2009) - [j32]Jeffrey H. Dinitz, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
Preface. Discret. Math. 309(3): 513-514 (2009) - [j31]Jeffrey H. Dinitz, Alan C. H. Ling, Peter Danziger:
Maximum uniformly resolvable designs with block sizes 2 and 4. Discret. Math. 309(14): 4716-4721 (2009) - [j30]A. J. Wolfe, Alan C. H. Ling, Jeffrey H. Dinitz:
The Existence of N2 Resolvable Latin Squares. SIAM J. Discret. Math. 23(3): 1217-1237 (2009) - 2007
- [j29]Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Perfect hash families from transversal designs. Australas. J Comb. 37: 233-242 (2007) - 2006
- [j28]Jeffrey H. Dinitz, Peter Dukes:
On the structure of uniform one-factorizations from starters in finite fields. Finite Fields Their Appl. 12(2): 283-300 (2006) - [j27]Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Stinson:
Fault-tolerant routings with minimum optical index. Networks 48(1): 47-55 (2006) - 2005
- [j26]Jeffrey H. Dinitz, Peter Dukes, Douglas R. Stinson:
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. Electron. J. Comb. 12 (2005) - 2004
- [j25]Dan Archdeacon, Marisa Debowsky, Jeffrey H. Dinitz, Heather Gavlas:
Cycle systems in the complete bipartite graph minus a one-factor. Discret. Math. 284(1-3): 37-43 (2004) - 2003
- [j24]Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek:
Preface. Discret. Math. 261(1-3): 1-2 (2003) - [j23]Jeffrey H. Dinitz, Esther R. Lamken, Alan C. H. Ling:
Complementary partial resolution squares for Steiner triple systems. Discret. Math. 261(1-3): 243-254 (2003) - [j22]Jeffrey H. Dinitz, Peter Dukes, Alan C. H. Ling:
Sets of three pairwise orthogonal Steiner triple systems. J. Comb. Theory A 101(1): 90-116 (2003) - 2001
- [j21]Jeffrey H. Dinitz, Alan C. H. Ling:
The existence of referee squares. Discret. Math. 232(1-3): 109-112 (2001) - [j20]Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson:
Quorum Systems Constructed from Combinatorial Designs. Inf. Comput. 169(2): 160-173 (2001) - 2000
- [j19]Jeffrey H. Dinitz, Esther R. Lamken:
HOPs and COPs: Room frames with partitionable transversals. Des. Codes Cryptogr. 19(1): 5-26 (2000)
1990 – 1999
- 1999
- [j18]Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa:
Bicoloring Steiner Triple Systems. Electron. J. Comb. 6 (1999) - [r1]Charles J. Colbourn, Jeffrey H. Dinitz:
Combinatorial Designs. Handbook of Discrete and Combinatorial Mathematics 1999 - 1997
- [j17]Charles J. Colbourn, Jeffrey H. Dinitz:
Complete Arcs in Steiner Triple Systems. J. Comb. Theory A 80(2): 320-333 (1997) - 1996
- [j16]Jeffrey H. Dinitz, David K. Garnick:
Holey factorizations. Ars Comb. 44 (1996) - [c1]Charles J. Colbourn, Jeffrey H. Dinitz:
N(n), v(n): Similarities and Differences. DMTCS 1996: 25-37 - 1995
- [j15]Jeffrey H. Dinitz, W. J. Martin:
The stipulation polynomial of a uniquely list-colorable graph. Australas. J Comb. 11: 105-116 (1995) - [j14]Charles J. Colbourn, Jeffrey H. Dinitz, Mieczyslaw Wojtas:
Thwarts in Transversal Designs. Des. Codes Cryptogr. 5(3): 189-197 (1995) - 1994
- [j13]Jeffrey H. Dinitz, Douglas R. Stinson, Lie Zhu:
On the Spectra of Certain Classes of Room Frames. Electron. J. Comb. 1 (1994) - [j12]Jeffrey H. Dinitz, Esther R. Lamken:
Howell Designs with Sub-designs. J. Comb. Theory A 65(2): 268-301 (1994) - 1993
- [j11]Dan Archdeacon, Jeffrey H. Dinitz:
Indecomposable triple systems exist for all lambda. Discret. Math. 113(1-3): 1-6 (1993) - 1992
- [j10]Jeffrey H. Dinitz, David K. Garnick, András Gyárfás:
On the irregularity strength of the m × n grid. J. Graph Theory 16(4): 355-374 (1992) - 1991
- [j9]Dan Archdeacon, Jeffrey H. Dinitz:
Constructing indecomposable 1-factorizations of the complete multigraph. Discret. Math. 92(1-3): 9-19 (1991) - [j8]Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson:
Spanning sets and scattering sets in Steiner triple systems. J. Comb. Theory A 57(1): 46-59 (1991)
1980 – 1989
- 1989
- [j7]Jeffrey H. Dinitz, Douglas R. Stinson:
Some new perfect one-factorizations from starters in finite fields. J. Graph Theory 13(4): 405-415 (1989) - 1987
- [j6]Jeffrey H. Dinitz:
The existence of room 5-cubes. J. Comb. Theory A 45(1): 125-138 (1987) - 1985
- [j5]Jeffrey H. Dinitz:
Orthogonal one-factorization graphs. J. Graph Theory 9(1): 147-159 (1985) - 1983
- [j4]Jeffrey H. Dinitz, Douglas R. Stinson:
Mols with holes. Discret. Math. 44(2): 145-154 (1983) - [j3]Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis:
Room squares with holes of sides 3, 5, and 7. Discret. Math. 47: 221-228 (1983) - 1981
- [j2]Jeffrey H. Dinitz, Douglas R. Stinson:
The Spectrum of Room Cubes. Eur. J. Comb. 2(3): 221-230 (1981) - 1980
- [j1]Dan Archdeacon, Jeffrey H. Dinitz, Douglas R. Stinson, Timothy W. Tillson:
Some New Row-Complete Latin Squares. J. Comb. Theory A 29(3): 395-398 (1980)
Coauthor Index
aka: Douglas R. Stinson
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
