An improved upper bound on the length of the longest cycle of a supercritical random graph (2009)
Kemkes, Graeme, Wormald, Nicholas
We improve Luczak's upper bounds on the length of the longest cycle in the random graph G(n,M) in the "supercritical phase" where M=n/2+s and s=o(n) but n^{2/3}=o(s). The new upper bound is...
On the chromatic number of random d-regular graphs (2008)
Kemkes, Graeme, Pérez-Giménez, Xavier, Wormald, Nicholas
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(2k-3)log(k-1), then the...
New Task Types at the Canadian Computing Competition (2008)
Abstract. In the 2006 competition workshop held at Dagstuhl, Germany, there were many fruitful discussions about the difficulties facing computer science competitions today. Our competitions have...
Objective Scoring for Computing Competition Tasks (2008)
Graeme Kemkes, Troy Vasiga, Gordon Cormack
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...
Structure, scoring and purpose of computing competitions (2006)
Gordon Cormack, Graeme Kemkes, Ian Munro, Troy Vasiga
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...
Structure, scoring and purpose of computing competitions (2006)
Gordon Cormack, Graeme Kemkes, Ian Munro, Troy Vasiga
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...