Rebecca Milley, Memorial University of Newfoundland

Research

Combinatorial game theory Dominating walk Graph domination Graph searching k-limited packing Misere games Partizan games Scoring games

Latest funding

Combinatorial Games and Graph Optimization: Losing and Scoring, Packing and Walking
NSERC · 2017 · Principal investigator
$103,720

All 1 grants and awards

Combinatorial Games and Graph Optimization: Losing and Scoring, Packing and Walking

Principal investigatorNSERC2017Discovery Grants Program - Individual

Principal investigators: Milley, Rebecca

Keywords: combinatorial game theory; misere games; partizan games; scoring games; vertex packing; k-limited packing; graph searching; dominating walk; graph domination

$103,720

From CIHR, NSERC and SSHRC funding decisions: CIHR since 2008, NSERC since 1991 and SSHRC since 1998, including their latest published competition results.

Write to this professor

A short, specific email works best. This draft uses one of their recent papers; replace the parts in brackets with your own details before sending.

Applying for

Subject: Prospective PhD student: Combinatorial game theory Dear Professor Milley, My name is [your name], and I am a [your current degree or role] at [your institution]. I am applying for a PhD position starting in [term and year]. Your research on combinatorial game theory connects closely to my own work on [your research topic]. [One or two sentences on what you did and what you learned.] Are you accepting new PhD students for [term and year]? I have attached my CV and transcripts, and I would be glad to talk at a time that suits you. Thank you for your time. Kind regards, [your name]