( en | de | ru )

 

Disambiguation of "Kemkes, Graeme"

Author of the publication

copydeleteadd this publication to your clipboard
Almost all cop-win graphs contain a universal vertex.

, , and . Discret. Math., 312 (10): 1652-1657 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Kemkes

Bertold Kemkes

Hans Kemkes

Graeme Cokayne

Graeme Smith

 

Other publications of authors with the same name

Stirling Numbers for Complex Arguments: Asymptotics and Identities., , , and . SIAM J. Discret. Math., 16 (2): 179-191 (2003)An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph., and . SIAM J. Discret. Math., 27 (1): 342-362 (2013)Almost all cop-win graphs contain a universal vertex., , and . Discret. Math., 312 (10): 1652-1657 (2012)Statistical Selection of Exact Answers (MultiText Experiments for TREC 2002)., , , , , , and . TREC, volume 500-251 of NIST Special Publication, National Institute of Standards and Technology (NIST), (2002)Towards a Weighted Version of the Hajnal-Szemerédi Theorem., , , and . Comb. Probab. Comput., 22 (3): 346-350 (2013)Structure, Scoring and Purpose of Computing Competitions., , , and . Informatics Educ., 5 (1): 15-36 (2006)Asymptotic enumeration of sparse 2-connected graphs., , and . Random Struct. Algorithms, 43 (3): 354-376 (2013)Objective Scoring for Computing Competition Tasks., , and . ISSEP, volume 4226 of Lecture Notes in Computer Science, page 230-241. Springer, (2006)