I received my PhD from Dalhousie University in May 2019 where my supervisor was Jason Brown. After this, I was a Roncesvalles Postdoctoral Fellow in the School of Computer Science at the University of Guelph for two years under the supervision of Joe Sawada. I then worked as a postdoc under the supervision of Chính Hoàng at Wilfrid Laurier University. Starting in November 2021, I spent another two years as an Assistant Professor of Computing Science at The King's University in Edmonton, Alberta Canada. I am now an Assistant Professor in the School of Mathematical and Computational Sciences at the University of Prince Edward Island on beautiful PEI.
email: brcam(2.71828...)ron@up(2.71828...)i.ca (where the mathematical constant e is required)
I am most interested in problems where the mathematical structure of an object (most often graphs for me) can be exploited to develop better algorithms for certain problems. For the past several years, my research has mainly focused on hereditary families of graphs that contain only finitely many k-critical graphs for some integer k. These families then admit a polynomial-time and full certifying algorithm to determine their (k-1)-colourability, an NP-complete problem in general. From my PhD research, I also have a number of contributions on Graph Polynomials. My publications and other information on my research is available on the research tab here.