default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. H. John van Rees
Person information
- affiliation: University of Manitoba, Winnipeg, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j20]Pak Ching Li, G. H. John van Rees:
A sharp lower bound on the number of hyperedges in a friendship 3-hypergraph. Australas. J Comb. 57: 73-78 (2013)- 2012
- [j19]Pak Ching Li, G. H. John van Rees, Stela Hanbyeol Seo
, N. M. Singhi:
Friendship 3-hypergraphs. Discret. Math. 312(11): 1892-1899 (2012)
2000 – 2009
- 2009
- [j18]G. H. John van Rees:
More greedy defining sets in Latin squares. Australas. J Comb. 44: 183-198 (2009) - 2008
- [j17]Nicholas J. Cavenagh, Diane M. Donovan, Abdollah Khodkar, G. H. John van Rees:
When is a partial Latin square uniquely completable, but not its completable product? Discret. Math. 308(13): 2830-2843 (2008) - 2007
- [j16]D. Deng, Douglas R. Stinson, Pak Ching Li, G. H. John van Rees, Ruizhong Wei:
Constructions and bounds for (m, t)-splitting systems. Discret. Math. 307(1): 18-37 (2007) - 2004
- [j15]Alan C. H. Ling, Pak Ching Li, G. H. John van Rees:
Splitting systems and separating systems. Discret. Math. 279(1-3): 355-368 (2004) - 2003
- [j14]John A. Bate, G. H. John van Rees:
Minimal and near-minimal critical sets in back-circulant latin squares. Australas. J Comb. 27: 47-62 (2003) - 2002
- [j13]John A. Bate, G. H. John van Rees:
A note on critical sets. Australas. J Comb. 25: 299-302 (2002) - [j12]Charles J. Colbourn, Douglas R. Stinson, G. H. John van Rees:
Preface: In Honour of Ronald C. Mullin. Des. Codes Cryptogr. 26(1-3): 5-6 (2002) - [j11]R. T. Bilous, G. H. John van Rees:
An Enumeration of Binary Self-Dual Codes of Length 32. Des. Codes Cryptogr. 26(1-3): 61-86 (2002)
1990 – 1999
- 1999
- [j10]John A. Bate, G. H. John van Rees:
The Size of the Smallest Strong Critical Set in a Latin Square. Ars Comb. 53 (1999) - [j9]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) - [j8]David A. Drake, G. H. John van Rees, W. D. Wallis:
Maximal sets of mutually orthogonal Latin squares. Discret. Math. 194(1-3): 87-94 (1999) - 1997
- [j7]Ebadollah S. Mahmoodian, G. H. John van Rees:
Critical sets in back circulant Latin rectangles. Australas. J Comb. 16: 45-50 (1997) - 1991
- [j6]William L. Kocay, G. H. John van Rees:
Some non-isomorphic (4t + 4, 8t + 6, 4t + 3, 2t + 2, 2t + 1)- BIBD's. Discret. Math. 92(1-3): 159-172 (1991) - [c1]Gerhard W. Dueck, G. H. John van Rees:
On the Maximum Number of Implicants Needed to Cover a Multiple-Valued Logic Function Using Window Literals. ISMVL 1991: 280-286
1980 – 1989
- 1989
- [j5]G. H. John van Rees:
A new family of BIBDs and non-embeddable (16, 24, 9, 6, 3)-designs. Discret. Math. 77(1-3): 357-365 (1989) - 1988
- [j4]Marshall Hall Jr., Robert Roth, G. H. John van Rees, Scott A. Vanstone:
On designs (22, 33, 12, 8, 4). J. Comb. Theory A 47(2): 157-175 (1988) - 1984
- [j3]Douglas R. Stinson, G. H. John van Rees:
The equivalence of certain equidistant binary codes and symmetric BIBDs. Comb. 4(4): 357-362 (1984) - 1982
- [j2]Andries E. Brouwer, G. H. John van Rees:
More mutually orthogonal latin squares. Discret. Math. 39(3): 263-281 (1982)
1970 – 1979
- 1975
- [j1]David M. Jackson, G. H. John van Rees:
The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices. SIAM J. Comput. 4(4): 474-477 (1975)
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-08-05 20:25 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:
