default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf S. Rees
Person information
- affiliation: Memorial University of Newfoundland, Department of Mathematics and Statistics, St. John's, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j35]Dameng Deng, Rolf S. Rees, Hao Shen:
On the existence of nearly Kirkman triple systems with subsystems. Des. Codes Cryptogr. 48(1): 17-33 (2008)- [j34]Gennian Ge, Malcolm Greig, Alan C. H. Ling, Rolf S. Rees:
Resolvable balanced incomplete block designs with subdesigns of block size 4. Discret. Math. 308(13): 2674-2703 (2008) - [j33]Gennian Ge, Martin Grüttmüller, Sven Hartmann, Rolf S. Rees:
Mandatory representation designs I with k=2mod3. Discret. Math. 308(23): 5394-5406 (2008) - 2007
- [j32]Gennian Ge, Rolf S. Rees, Nabil Shalaby:
Kirkman frames having hole type hu m1 for small h. Des. Codes Cryptogr. 45(2): 157-184 (2007) - 2004
- [j31]Gennian Ge, Rolf S. Rees:
On group-divisible designs with block size four and group-type 6um1. Discret. Math. 279(1-3): 247-265 (2004) - [j30]Izabela Adamczak, Donald L. Kreher
, Rolf S. Rees:
Tight incomplete block designs. Discret. Math. 284(1-3): 11-20 (2004) - 2003
- [j29]Dameng Deng, Rolf S. Rees, Hao Shen:
On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12. Discret. Math. 261(1-3): 209-233 (2003) - [j28]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) - [j27]Dameng Deng, Rolf S. Rees, Hao Shen:
Further results on nearly Kirkman triple systems with subsystems. Discret. Math. 270(1-3): 98-113 (2003) - [j26]Dameng Deng, Hao Shen, Rolf S. Rees:
On the Existence of Nearly Kirkman Triple Systems with Subsystems. Electron. Notes Discret. Math. 15: 79-81 (2003) - 2002
- [j25]Rolf S. Rees:
The spectrum of triangle-free regular graphs containing a cut vertex. Australas. J Comb. 26: 135-146 (2002) - [j24]Gennian Ge, Rolf S. Rees:
n Group-Divisible Designs with Block Size Four and Group-Type gum1. Des. Codes Cryptogr. 27(1-2): 5-24 (2002) - [j23]Gennian Ge, Rolf S. Rees, Lie Zhu:
Group-Divisible Designs with Block Size Four and Group-Type gum1 with m as Large or as Small as Possible. J. Comb. Theory A 98(2): 357-376 (2002) - 2001
- [j22]Nicholas C. K. Phillips, W. D. Wallis, Rolf S. Rees:
Packings and coverings of v=3m+1 points with near-triangle factors. Australas. J Comb. 23: 53-70 (2001) - 2000
- [j21]Rolf S. Rees, Nabil Shalaby, Ahmad Sharary:
Indecomposable Skolem and Rosa sequences. Australas. J Comb. 21: 3-12 (2000) - [j20]Rolf S. Rees:
Truncated Transversal Designs: A New Lower Bound on the Number of Idempotent MOLS of Side n. J. Comb. Theory A 90(2): 257-266 (2000)
1990 – 1999
- 1999
- [j19]Rolf S. Rees, Douglas R. Stinson, Ruizhong Wei, G. H. John van Rees:
An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb. 53 (1999) - 1996
- [j18]Rolf S. Rees, Douglas R. Stinson:
Combinatorial Characterizations of Authentication Codes II. Des. Codes Cryptogr. 7(3): 239-259 (1996) - 1994
- [j17]Rolf S. Rees, Alexander Rosa, Walter D. Wallis:
Maximal sets of triangle- factors. Australas. J Comb. 9: 67-108 (1994) - 1992
- [j16]Charles J. Colbourn, Dean G. Hoffman, Rolf S. Rees:
A New Class of Group Divisible Designs with Block Size Three. J. Comb. Theory A 59(1): 73-89 (1992) - 1991
- [j15]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) - [j14]Rolf S. Rees:
The spectrum of restricted resolvable designs with r = 2. Discret. Math. 92(1-3): 305-320 (1991) - [j13]Maria Corinna Marino, Rolf S. Rees:
On parallelism in Steiner systems. Discret. Math. 97(1-3): 295-300 (1991) - [j12]Rolf S. Rees, Walter D. Wallis:
The spectrum of maximal sets of one-factors. Discret. Math. 97(1-3): 357-369 (1991) - 1990
- [j11]Paul Moore, Rolf S. Rees:
On the number of connecting lines determined by n points in the real plane. Australas. J Comb. 1: 127-148 (1990) - [j10]Rolf S. Rees:
The existence of restricted resolvable designs I: (1, 2)-factorizations of K2n. Discret. Math. 81(1): 49-80 (1990) - [j9]Rolf S. Rees:
The existence of restricted resolvable designs II: (1, 2)-factorizations of K2n+1. Discret. Math. 81(3): 263-301 (1990) - [j8]Sean McGuinness, Rolf S. Rees:
On the number of distinct minimal clique partitions and clique covers of a line graph. Discret. Math. 83(1): 49-62 (1990) - [j7]Rolf S. Rees, Douglas R. Stinson:
On the number of blocks in a perfect covering of upsilon points. Discret. Math. 83(1): 81-93 (1990)
1980 – 1989
- 1989
- [j6]Rolf S. Rees, Douglas R. Stinson:
On combinatorial designs with subdesigns. Discret. Math. 77(1-3): 259-279 (1989) - [j5]Andrew Granville, Alexandros Moisiadis, Rolf S. Rees:
On complementary decompositions of the complete graph. Graphs Comb. 5(1): 57-61 (1989) - 1988
- [j4]Rolf S. Rees:
Frames and the g(k)(v) problem. Discret. Math. 71(3): 243-256 (1988) - [j3]Eric Mendelsohn, Rolf S. Rees:
Mandatory representation designs. J. Comb. Theory A 49(2): 349-362 (1988) - 1987
- [j2]Rolf S. Rees:
Uniformly resolvable pairwise balanced designs with blocksizes two and three. J. Comb. Theory A 45(2): 207-225 (1987) - 1986
- [j1]Rolf S. Rees:
Minimal clique partitions and pairwise balanced designs. Discret. Math. 61(2-3): 269-280 (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 20:23 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:
