This profile is built from public research funding records (CIHR, NSERC and SSHRC). We have not imported them from a Wilfrid Laurier University directory, so their publications, courses and email address may be missing. Find their university profile.
Research
Latest funding
- $279,000
Graph Algorithms
NSERC · 2016 · Principal investigator
- $75,000
Graph algorithms
NSERC · 2009 · Principal investigator
- $90,000
Robust algorithms for existentially polytime theorems
NSERC · 2004 · Principal investigator
Graph Algorithms
Principal investigators: Cameron, Kathleen
Keywords: graph algorithms; graph theory; combinatorial optimization; structured graph classes; graph coloring; stable set polytope; degree-contrained spanning trees; second hamilton cycle; induced matching; polyhedral combinatorics
Graph algorithms
Principal investigators: Cameron, Kathleen
Robust algorithms for existentially polytime theorems
Principal investigators: Cameron, Kathleen
Algorithms for existentially polytime theorems
Principal investigators: Cameron, Kathleen
Algorithms for existentially polytime theorems
Principal investigators: Cameron, Kathleen
From CIHR, NSERC and SSHRC funding decisions: CIHR since 2008, NSERC since 1991 and SSHRC since 1998, including their latest published competition results.
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.