default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald L. Kreher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Simon R. Blackburn
, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and Bounds for Codes With Restricted Overlaps. IEEE Trans. Inf. Theory 70(4): 2479-2490 (2024)- 2022
- [i1]Simon R. Blackburn, Navid Nasr Esfahani, Donald L. Kreher, Douglas R. Stinson:
Constructions and bounds for codes with restricted overlaps. CoRR abs/2211.10309 (2022) - 2020
- [j35]Melissa S. Keranen, Donald L. Kreher, Salvatore Milici, Antoinette Tripodi:
Uniformly resolvable decompositions of Kv in 1-factors and 4-stars. Australas. J Comb. 76: 55-72 (2020) - [j34]Donald L. Kreher, Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of directed triple systems. Discret. Math. 343(4): 111773 (2020) - [j33]Donald L. Kreher, Douglas R. Stinson, Shannon Veitch:
Block-avoiding point sequencings of Mendelsohn triple systems. Discret. Math. 343(5): 111799 (2020)
2010 – 2019
- 2019
- [j32]Donald L. Kreher, Douglas R. Stinson:
Block-avoiding sequencings of points in Steiner triple systems. Australas. J Comb. 74: 498-509 (2019) - [j31]Donald L. Kreher, Douglas R. Stinson:
Nonsequenceable Steiner triple systems. Bull. ICA 86: 64-68 (2019) - [j30]Brian Alspach, Afsaneh Khodadadpour, Donald L. Kreher:
On factor-invariant graphs. Discret. Math. 342(8): 2173-2178 (2019) - 2018
- [j29]William J. Keith, Dalibor Froncek, Donald L. Kreher:
A note on nearly platonic graphs. Australas. J Comb. 70: 86-103 (2018) - [j28]William J. Keith, Dalibor Froncek, Donald L. Kreher:
Corrigendum to: A note on nearly platonic graphs. Australas. J Comb. 72: 163- (2018) - [j27]Jezerca Hodaj, Melissa S. Keranen, Donald L. Kreher, Leah Tollefson:
Some new Kirkman signal sets. Des. Codes Cryptogr. 86(10): 2183-2195 (2018) - 2017
- [j26]Brian Alspach, Donald L. Kreher, Adrián Pastine:
The Friedlander-Gordon-Miller conjecture is true. Australas. J Comb. 67: 11-24 (2017) - 2015
- [j25]Donald L. Kreher, Adrián Pastine, Leah Tollefson:
A note on the cyclic matching sequencibility of graphs. Australas. J Comb. 61: 142-146 (2015) - 2014
- [j24]Charles J. Colbourn, Melissa S. Keranen, Donald L. Kreher:
f-vectors of pure complexes and pure multicomplexes of rank three. Discret. Math. 320: 26-39 (2014) - [j23]William L. Kocay, Donald L. Kreher:
On Reconstructing Graphs and Their Complements. SIAM J. Discret. Math. 28(3): 1026-1034 (2014) - 2013
- [j22]Brian Alspach, Cafer Çaliskan, Donald L. Kreher:
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups. Discret. Math. 313(13): 1475-1489 (2013)
2000 – 2009
- 2009
- [j21]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) - [j20]Erik E. Westlund, Jiuqiang Liu, Donald L. Kreher:
6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable. Discret. Math. 309(16): 5106-5110 (2009) - 2008
- [j19]Artem A. Zhuravlev, Melissa S. Keranen, Donald L. Kreher:
Small Group Divisible Steiner Quadruple Systems. Electron. J. Comb. 15(1) (2008) - 2005
- [b1]William L. Kocay, Donald L. Kreher:
Graphs, algorithms and optimization. Chapman&Hall/CRC Press 2005, ISBN 978-1-58488-396-8, pp. 1-481 - 2004
- [j18]Hans-Dietrich O. F. Gronau, Donald L. Kreher, Alan C. H. Ling:
Super-simple (v, 5, 2)-designs. Discret. Appl. Math. 138(1-2): 65-77 (2004) - [j17]Izabela Adamczak, Donald L. Kreher, Rolf S. Rees:
Tight incomplete block designs. Discret. Math. 284(1-3): 11-20 (2004) - 2003
- [j16]Donald L. Kreher, Alan C. H. Ling, Rolf S. Rees, Clement W. H. Lam:
A note on {4}-GDDs of type 210. Discret. Math. 261(1-3): 373-376 (2003)
1990 – 1999
- 1999
- [j15]M. A. Chateauneuf, Charles J. Colbourn, Donald L. Kreher:
Covering Arrays of Strength Three. Des. Codes Cryptogr. 16(3): 235-242 (1999) - [j14]Donald L. Kreher, Douglas R. Stinson:
Combinatorial algorithms: generation, enumeration, and search. SIGACT News 30(1): 33-35 (1999) - 1996
- [j13]Charles J. Colbourn, Donald L. Kreher:
Concerning Difference Matrices. Des. Codes Cryptogr. 9(1): 61-70 (1996) - [j12]Donald L. Kreher, Gordon F. Royle, W. D. Wallis:
A family of resolvable regular graph designs. Discret. Math. 156(1-3): 269-275 (1996) - 1995
- [j11]Elizabeth J. Billington, Donald L. Kreher:
The intersection problem for small G-designs. Australas. J Comb. 12: 239-258 (1995) - [j10]Michael J. Gilpen, Donald L. Kreher:
A note on spanning trees in near d-angulations. Ars Comb. 41 (1995) - [j9]Charles J. Colbourn, Charles A. Cusack, Donald L. Kreher:
Partial Steiner Triple Systems with Equal-Sized Holes. J. Comb. Theory A 70(1): 56-65 (1995) - 1993
- [j8]Donald L. Kreher, Dominique de Caen, Sylvia A. Hobart, Earl S. Kramer, Stanislaw P. Radziszowski:
The parameters 4-(12, 6, 6) and related t-designs. Australas. J Comb. 7: 3-20 (1993) - 1991
- [j7]D. de Caen, Donald L. Kreher, Stanislaw P. Radziszowski, W. H. Mills:
On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5). Discret. Math. 92(1-3): 65-77 (1991) - 1990
- [j6]Yeow Meng Chee, Charles J. Colbourn, Steven Furino, Donald L. Kreher:
Large sets of disjoint t-designs. Australas. J Comb. 2: 111-120 (1990)
1980 – 1989
- 1989
- [j5]Donald L. Kreher:
A generalization of Connor's inequality to t-designs with automorphisms. J. Comb. Theory A 50(2): 259-268 (1989) - 1988
- [j4]Stanislaw P. Radziszowski, Donald L. Kreher:
Search algorithm for Ramsey graphs by union of group orbits. J. Graph Theory 12(1): 59-72 (1988) - 1986
- [j3]Donald L. Kreher:
An incidence algebra for t-designs with automorphisms. J. Comb. Theory A 42(2): 239-251 (1986) - [j2]Donald L. Kreher, Stanislaw P. Radziszowski:
The existence of simple 6-(14, 7, 4) designs. J. Comb. Theory A 43(2): 237-243 (1986) - 1983
- [j1]Leo G. Chouinard, Earl S. Kramer, Donald L. Kreher:
Graphical t-wise balanced designs. Discret. Math. 46(3): 227-240 (1983)
Coauthor Index
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:24 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:
