#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2002

2013

- This year (0)
- Last 5 years (3)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Charles L. A. Clarke, Gordon V. Cormack, +4 authors Philip L. Tilker
- TREC
- 2002

We identify aspects of computing competition formats as they relate to the purpose of these competitions, both stated and tacit. We consider the major international competitions â€“ the Internationalâ€¦ (More)

- Gordon V. Cormack, J. Ian Munro, Troy Vasiga, Graeme Kemkes
- Informatics in Education
- 2006

We identify aspects of computing competition formats as they relate to the purpose of these competitions, both stated and tacit. We consider the major international competitions â€“ the Internationalâ€¦ (More)

In this work we show that, for any fixed d, random d-regular graphs asymptotically almost surely can be coloured with k colours, where k is the smallest integer satisfying d < 2(kâˆ’1) log(kâˆ’1). Fromâ€¦ (More)

- Josep DÃaz, Alexis C. Kaporis, Graeme Kemkes, Lefteris M. Kirousis, Xavier PÃ©rez, Nicholas C. Wormald
- Journal of Graph Theory
- 2009

It was only recently shown by Shi and Wormald, using the differential equation method to analyse an appropriate algorithm, that a random 5-regular graph asymptotically almost surely has chromaticâ€¦ (More)

- Graeme Kemkes, Troy Vasiga, Gordon V. Cormack
- ISSEP
- 2006

Computing competitions like the International Olympiad in Informatics (IOI) typically pose several problems that contestants are required to solve by writing a program. The program is testedâ€¦ (More)

- Anthony Bonato, Graeme Kemkes, Pawel Pralat
- Discrete Mathematics
- 2012

We consider cop-win graphs in the binomial random graph G(n, 1/2). We prove that almost all cop-win graphs contain a universal vertex. From this result, we derive that the asymptotic number ofâ€¦ (More)

- JÃ³zsef Balogh, Graeme Kemkes, Choongbum Lee, Stephen J. Young
- Combinatorics, Probability & Computing
- 2013

For a positive integer r â‰¥ 2, a Kr-factor of a graph is a collection vertex-disjoint copies of Kr which covers all the vertices of the given graph. The celebrated theorem of Hajnal and SzemerÃ©diâ€¦ (More)

- Graeme Kemkes, Chiu Fan Lee, Donatella Merlini, L. Bruce Richmond
- SIAM J. Discrete Math.
- 2003

- Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald
- Random Struct. Algorithms
- 2013

We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on n vertices and m edges, provided that mâˆ’nâ†’âˆž and m = O(n logn) as nâ†’âˆž. This is the entire range of m notâ€¦ (More)