default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEsther R. Lamken
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j30]Peter J. Dukes
, Esther R. Lamken:
Constructions and uses of incomplete pairwise balanced designs. Des. Codes Cryptogr. 87(12): 2729-2751 (2019)- 2016
- [j29]Peter J. Dukes, Esther R. Lamken, Alan C. H. Ling:
Resolvable Group Divisible Designs with Large Groups. Electron. J. Comb. 23(4): 4 (2016) - 2015
- [j28]Esther R. Lamken:
The asymptotic existence of DR(v, k, k-1)-BIBDs. Des. Codes Cryptogr. 77(2-3): 553-562 (2015) - 2013
- [j27]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)
2000 – 2009
- 2008
- [j26]R. Julian R. Abel, Esther R. Lamken, Jinhua Wang:
A few more Kirkman squares and doubly near resolvable BIBDs with block size 3. Discret. Math. 308(7): 1102-1123 (2008) - 2006
- [j25]Gennian Ge, Esther R. Lamken, Alan C. H. Ling:
Scheduling CCRR tournaments. J. Comb. Theory A 113(2): 352-379 (2006) - 2003
- [j24]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) - 2002
- [j23]Charles J. Colbourn, Esther R. Lamken, Alan C. H. Ling, W. H. Mills:
The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs. Des. Codes Cryptogr. 26(1-3): 169-196 (2002) - 2000
- [j22]Jeffrey H. Dinitz, Esther R. Lamken:
HOPs and COPs: Room frames with partitionable transversals. Des. Codes Cryptogr. 19(1): 5-26 (2000) - [j21]Esther R. Lamken, Richard M. Wilson:
Decompositions of Edge-Colored Complete Graphs. J. Comb. Theory A 89(2): 149-200 (2000)
1990 – 1999
- 1998
- [j20]Esther R. Lamken:
The existence of KS3(v; 2, 4). Discret. Math. 186(1-3): 195-216 (1998) - 1997
- [j19]Esther R. Lamken:
The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3. Des. Codes Cryptogr. 11(1): 37-71 (1997) - 1996
- [j18]Esther R. Lamken:
A few more partitioned balanced tournament designs. Ars Comb. 43 (1996) - 1995
- [j17]Esther R. Lamken:
The Existence of Doubly Resolvable (v, 3, 2) - BIBDs. J. Comb. Theory A 72(1): 50-76 (1995) - 1994
- [j16]Esther R. Lamken:
Constructions for generalized balanced tournament designs. Discret. Math. 131(1-3): 127-151 (1994) - [j15]Jeffrey H. Dinitz, Esther R. Lamken:
Howell Designs with Sub-designs. J. Comb. Theory A 65(2): 268-301 (1994) - 1993
- [j14]Esther R. Lamken:
Existence Results for Generalized Balanced Tournament Designs with Block Size 3. Des. Codes Cryptogr. 3(1): 33-61 (1993) - [j13]Esther R. Lamken, Scott A. Vanstone:
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs. Discret. Math. 120(1-3): 135-148 (1993) - 1991
- [j12]Esther R. Lamken, W. H. Mills, Richard M. Wilson:
Four Pairwise Balanced Designs. Des. Codes Cryptogr. 1(1): 63-68 (1991) - [j11]Esther R. Lamken:
3-complementary frames and doubly near resolvable (v, 3, 2)- BIBDs. Discret. Math. 88(1): 59-78 (1991) - [j10]Esther R. Lamken:
The existence of 3 orthogonal partitioned incomplete Latin squares of type tn. Discret. Math. 89(3): 231-251 (1991) - [j9]Esther R. Lamken, Rolf S. Rees, Scott A. Vanstone:
Class-uniformly resolvable pairwise balanced designs with block sizes two and three. Discret. Math. 92(1-3): 197-209 (1991) - [j8]Esther R. Lamken:
On near generalized balanced tournament designs. Discret. Math. 97(1-3): 279-294 (1991) - 1990
- [j7]Esther R. Lamken, Scott A. Vanstone:
Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds. Discret. Math. 83(1): 37-47 (1990) - [j6]Esther R. Lamken, Scott A. Vanstone:
The existence of skew Howell designs of side 2n and order 2n + 2. J. Comb. Theory A 54(1): 20-40 (1990)
1980 – 1989
- 1989
- [j5]Esther R. Lamken, Scott A. Vanstone:
Balanced tournament designs and related topics. Discret. Math. 77(1-3): 159-176 (1989) - 1988
- [j4]Esther R. Lamken, Scott A. Vanstone:
Orthogonal resolutions in odd balanced tournament designs. Graphs Comb. 4(1): 241-255 (1988) - 1987
- [j3]Esther R. Lamken, W. H. Mills, Ronald C. Mullin, Scott A. Vanstone:
Coverings of Pairs by Quintuples. J. Comb. Theory A 44(1): 49-68 (1987) - 1986
- [j2]Esther R. Lamken, Scott A. Vanstone:
Existence results for KS3(v; 2, 4)s. Discret. Math. 62(2): 197-210 (1986) - [j1]Esther R. Lamken, Scott A. Vanstone:
Designs With Mutually Orthogonal Resolutions. Eur. J. Comb. 7(3): 249-257 (1986)
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:21 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:
