Esther R. Lamken

According to our database1, Esther R. Lamken authored at least 30 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Constructions and uses of incomplete pairwise balanced designs.
Des. Codes Cryptogr., 2019

2016
Resolvable Group Divisible Designs with Large Groups.
Electron. J. Comb., 2016

2015
The asymptotic existence of DR(v, k, k-1)-BIBDs.
Des. Codes Cryptogr., 2015

2013
On the existence of three dimensional Room frames and Howell cubes.
Discret. Math., 2013

2008
A few more Kirkman squares and doubly near resolvable BIBDs with block size 3.
Discret. Math., 2008

2006
Scheduling <i>CCRR</i> tournaments.
J. Comb. Theory, Ser. A, 2006

2003
Complementary partial resolution squares for Steiner triple systems.
Discret. Math., 2003

2002
The Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs.
Des. Codes Cryptogr., 2002

2000
Decompositions of Edge-Colored Complete Graphs.
J. Comb. Theory, Ser. A, 2000

HOPs and COPs: Room frames with partitionable transversals.
Des. Codes Cryptogr., 2000

1998
The existence of KS<sub>3</sub>(v; 2, 4).
Discret. Math., 1998

1997
The Existence of Partitioned Generalized Balanced Tournament Designs with Block Size 3.
Des. Codes Cryptogr., 1997

1996
A few more partitioned balanced tournament designs.
Ars Comb., 1996

1995
The Existence of Doubly Resolvable (v, 3, 2) - BIBDs.
J. Comb. Theory, Ser. A, 1995

1994
Howell Designs with Sub-designs.
J. Comb. Theory, Ser. A, 1994

Constructions for generalized balanced tournament designs.
Discret. Math., 1994

1993
Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs.
Discret. Math., 1993

Existence Results for Generalized Balanced Tournament Designs with Block Size 3.
Des. Codes Cryptogr., 1993

1991
Class-uniformly resolvable pairwise balanced designs with block sizes two and three.
Discret. Math., 1991

On near generalized balanced tournament designs.
Discret. Math., 1991

The existence of 3 orthogonal partitioned incomplete Latin squares of type t<sup>n</sup>.
Discret. Math., 1991

3-complementary frames and doubly near resolvable (v, 3, 2)- BIBDs.
Discret. Math., 1991

Four Pairwise Balanced Designs.
Des. Codes Cryptogr., 1991

1990
The existence of skew Howell designs of side 2<i>n</i> and order 2<i>n</i> + 2.
J. Comb. Theory, Ser. A, 1990

Balanced tournament designs and resolvable (upsilon, 3, 2)-bibds.
Discret. Math., 1990

1989
Balanced tournament designs and related topics.
Discret. Math., 1989

1988
Orthogonal resolutions in odd balanced tournament designs.
Graphs Comb., 1988

1987
Coverings of Pairs by Quintuples.
J. Comb. Theory, Ser. A, 1987

1986
Designs With Mutually Orthogonal Resolutions.
Eur. J. Comb., 1986

Existence results for KS<sub>3</sub>(v; 2, 4)s.
Discret. Math., 1986


  Loading...