Statistical Selection of Exact Answers (MultiText Experiments for TREC 2002). - Charles L. A. Clarke; Gordon V. Cormack; Graeme Kemkes; M. Laszlo; Thomas R. Lynam; Egidio L. Terra; Philip L. Tilker (TREC, 2002)

Stirling Numbers for Complex Arguments: Asymptotics and Identities. - Graeme Kemkes; Chiu Fan Lee; Donatella Merlini; L. Bruce Richmond (SIAM J. Discret. Math., 2003)

Objective Scoring for Computing Competition Tasks. - Graeme Kemkes; Troy Vasiga; Gordon V. Cormack (ISSEP, 2006)

Structure, Scoring and Purpose of Computing Competitions. - Gordon V. Cormack; J. Ian Munro; Troy Vasiga; Graeme Kemkes (Informatics Educ., 2006)

On the chromatic number of a random 5-regular graph. - Josep Díaz; Alexis C. Kaporis; G. D. Kemkes; Lefteris M. Kirousis; Xavier Pérez-Giménez; Nicholas C. Wormald (J. Graph Theory, 2009)

Using matrices to link conflict evolution and resolution in a graph model. - Haiyan Xu 001; D. Marc Kilgour; Keith W. Hipel; Graeme Kemkes (Eur. J. Oper. Res., 2010)

Almost all cop-win graphs contain a universal vertex. - Anthony Bonato; Graeme Kemkes; Pawel Pralat (Discret. Math., 2012)

Towards a Weighted Version of the Hajnal-Szemerédi Theorem. - József Balogh; Graeme Kemkes; Choongbum Lee; Stephen J. Young (Comb. Probab. Comput., 2013)

Asymptotic enumeration of sparse 2-connected graphs. - Graeme Kemkes; Cristiane M. Sato; Nicholas C. Wormald (Random Struct. Algorithms, 2013)

An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph. - Graeme Kemkes; Nicholas C. Wormald (SIAM J. Discret. Math., 2013)