Graeme Kemkes

According to our database1, Graeme Kemkes authored at least 10 papers between 2002 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph.
SIAM J. Discret. Math., 2013

Asymptotic enumeration of sparse 2-connected graphs.
Random Struct. Algorithms, 2013

Towards a Weighted Version of the Hajnal-Szemerédi Theorem.
Comb. Probab. Comput., 2013

2012
Almost all cop-win graphs contain a universal vertex.
Discret. Math., 2012

2010
Using matrices to link conflict evolution and resolution in a graph model.
Eur. J. Oper. Res., 2010

2009
On the chromatic number of a random 5-regular graph.
J. Graph Theory, 2009

2006
Structure, Scoring and Purpose of Computing Competitions.
Informatics Educ., 2006

Objective Scoring for Computing Competition Tasks.
Proceedings of the Informatics Education - The Bridge between Using and Understanding Computers, International Conference in Informatics in Secondary Schools, 2006

2003
Stirling Numbers for Complex Arguments: Asymptotics and Identities.
SIAM J. Discret. Math., 2003

2002
Statistical Selection of Exact Answers (MultiText Experiments for TREC 2002).
Proceedings of The Eleventh Text REtrieval Conference, 2002


  Loading...