Richard Brewster, Thompson Rivers University

Research

graph homomorphism graph packing and covering graph dominating sets combinatorial reconfiguration dichotomy theorem good characterization signed graph graph algorithm

Latest funding

Computational Complexity of Combinatorial problems: graph theoretical algorithms and structures
NSERC · 2023 · Principal investigator
$32,500
Computational complexity of combinatorial problems: graph homomorphisms, packings, and good characterizations
NSERC · 2014 · Principal investigator
$222,300
Computational complexity of combinatorial and graph theoretic problems
NSERC · 2009 · Principal investigator
$95,000

All 5 grants and awards

Computational Complexity of Combinatorial problems: graph theoretical algorithms and structures

Principal investigatorNSERC2023Discovery Grants Program - Individual

Principal investigators: Brewster, Richard

Keywords: graph homomorphism; graph packing and covering; graph dominating sets; combinatorial reconfiguration; dichotomy theorem; good characterization; signed graph; graph algorithm; graph colouring

$32,500

Computational complexity of combinatorial problems: graph homomorphisms, packings, and good characterizations

Principal investigatorNSERC2014Discovery Grants Program - Individual

Principal investigators: Brewster, Richard

$222,300

Computational complexity of combinatorial and graph theoretic problems

Principal investigatorNSERC2009Discovery Grants Program - Individual

Principal investigators: Brewster, Richard

$95,000

Sharing Mathematics: A Tribute to Jim Totten

Principal investigatorNSERC2008Regional Office Discretionary Funds - British Columbia

Principal investigators: Brewster, Richard

$5,000

Computational complexity of combinatorial problems

Principal investigatorNSERC2004Discovery Grants Program - Individual

Principal investigators: Brewster, Richard

$65,000

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

Mention their NSERC grant from 2023

Subject: Prospective PhD student: graph homomorphism Dear Professor Brewster, 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 graph homomorphism connects closely to my own work on [your research topic]. [One or two sentences on what you did and what you learned.] I also saw your NSERC-funded project "Computational Complexity of Combinatorial problems: graph theoretical algorithms and structures" (2023), and I would be glad to contribute to work in that direction. 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]