Being a Golden Hawk means more than just cheering on our (really good) varsity teams – it means being a student who cares about your community, who works hard in the classroom, and who takes advantage of all the learning opportunities that can happen outside the classroom, too.
STEPS TO APPLY
Undergraduate Admissions Toolkit International Admissions Toolkit Graduate Admissions ToolkitSEND ME INFORMATION
SHOW ME THE CAMPUS
EXPLORE OUR PROGRAMS
I received my masters and PhD in Combinatorics and Optimization at the University of Waterloo following a BSc (Honours) in Mathematics at the University of Regina.
I have been at Wilfrid Laurier University since 1989. I have taught graduate courses at Stanford University, Cornell University, Université Pierre et Marie Curie (Paris 6), and the University of Waterloo. Recently, I spent 4 months in China giving lectures at Shanghai Jiao Tong University, Fudan University, Shanghai University, Soochow University, Nanjing University, Nanjing Normal University, Fuzhou University and Zhejiang Normal University.
My research is in graph algorithms and polytime combinatorial optimization. I use linear programming, network optimization, polyhedral combinatrorics and graph structure to develop efficient algorithms for discrete problems, mainly on graphs.
A vast number of fundamental problems on graphs, such as graph colouring, are NP-complete. This is believed to mean that efficient (that is, polytime) algorithms can not be found for all instances. Often graphs arising in applications have special structure which can be analyzed and exploited to design efficient algorithms for problems on these graphs which are NP-complete in general.
An existentially polytime (EP) theorem is one which states that something which is easy to recognize once you have it always exists. More formally, an EP theorem is an NP predicate which is always true. Jack Edmonds and I have raised the meta-conjecture that for every EP-theorem, there is a polytime algorithm to find what it asserts to exist. Much of my research focuses on finding such algorithms.
My current projects include finding a second degree-constrained spanning tree, intermediate trees, easily recognizable strong stable sets, rainbow matchings and monotone path systems in polygonal regions.
I am interested in supervising undergraduate and graduate students students in research projects in optimization, graph theory and graph algorithms.
Contact Info:
Office location: LH3041
Languages spoken: English
We see you are accessing our website on IE8. We recommend you view in Chrome, Safari, Firefox or IE9+ instead.
×