Rolf S. Rees

Affiliations:
  • Memorial University of Newfoundland, Department of Mathematics and Statistics, St. John's, Canada


According to our database1, Rolf S. Rees authored at least 34 papers between 1986 and 2008.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Resolvable balanced incomplete block designs with subdesigns of block size 4.
Discret. Math., 2008

Mandatory representation designs <i>I</i> with k=2mod3.
Discret. Math., 2008

On the existence of nearly Kirkman triple systems with subsystems.
Des. Codes Cryptogr., 2008

2007
Kirkman frames having hole type h<sup>u</sup> m<sup>1</sup> for small h.
Des. Codes Cryptogr., 2007

2004
On group-divisible designs with block size four and group-type 6<i><sup>u</sup><sub>m</sub></i>1.
Discret. Math., 2004

Tight incomplete block designs.
Discret. Math., 2004

2003
A note on {4}-GDDs of type 2<sup>10</sup>.
Discret. Math., 2003

On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12.
Discret. Math., 2003

Further results on nearly Kirkman triple systems with subsystems.
Discret. Math., 2003

2002
Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible.
J. Comb. Theory A, 2002

n Group-Divisible Designs with Block Size Four and Group-Type gum1.
Des. Codes Cryptogr., 2002

The spectrum of triangle-free regular graphs containing a cut vertex.
Australas. J Comb., 2002

2001
Packings and coverings of v=3m+1 points with near-triangle factors.
Australas. J Comb., 2001

2000
Truncated Transversal Designs: A New Lower Bound on the Number of Idempotent MOLS of Side n.
J. Comb. Theory A, 2000

Indecomposable Skolem and Rosa sequences.
Australas. J Comb., 2000

1999
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme.
Ars Comb., 1999

1996
Combinatorial Characterizations of Authentication Codes II.
Des. Codes Cryptogr., 1996

1994
Maximal sets of triangle- factors.
Australas. J Comb., 1994

1992
A New Class of Group Divisible Designs with Block Size Three.
J. Comb. Theory A, 1992

1991
The spectrum of maximal sets of one-factors.
Discret. Math., 1991

The spectrum of restricted resolvable designs with r = 2.
Discret. Math., 1991

On parallelism in Steiner systems.
Discret. Math., 1991

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

1990
On the number of blocks in a perfect covering of upsilon points.
Discret. Math., 1990

The existence of restricted resolvable designs II: (1, 2)-factorizations of K<sub>2n+1</sub>.
Discret. Math., 1990

The existence of restricted resolvable designs I: (1, 2)-factorizations of K<sub>2n</sub>.
Discret. Math., 1990

On the number of distinct minimal clique partitions and clique covers of a line graph.
Discret. Math., 1990

On the number of connecting lines determined by n points in the real plane.
Australas. J Comb., 1990

1989
On complementary decompositions of the complete graph.
Graphs Comb., 1989

On combinatorial designs with subdesigns.
Discret. Math., 1989

1988
Mandatory representation designs.
J. Comb. Theory A, 1988

Frames and the g<sup>(k)</sup>(v) problem.
Discret. Math., 1988

1987
Uniformly resolvable pairwise balanced designs with blocksizes two and three.
J. Comb. Theory A, 1987

1986
Minimal clique partitions and pairwise balanced designs.
Discret. Math., 1986


  Loading...