Research Pursuits

I study in general the computation complexity of combinatorial problems. In specific, I have worked mostly in the last few years on graph homomorphism problems, graph packings, and domination problems. I work on the boundary of mathematics and computer science exploring the interplay of elegant algorithms and nice mathematical theory.



Papers in Refereed Journals:

  1. R. C. Brewster, P. Hell, Sarah H. Pantel, R. Rizzi, A. Yeo, Packings path in digraphs, Journal of Graph Theory, 2003, to appear.
  2. R. C. Brewster, R. Rizzi, On the complexity of digraph packings, Information Processing Letters, 86(2003), 101-106.
  3. R. C. Brewster, P. Hell, Homomorphisms to powers of digraphs, Discrete Mathematics, 244(2002), 31-41.
  4. R. C. Brewster, G. MacGillivray, Minimizing β + Δ and well covered graphs, Ars Combinatoria, 61(2001), 197-210.
  5. R. C. Brewster, P. Hell, and G. MacGillivray, The restricted homomorphism problem, Discrete Mathematics, 167/168 (1997), 145-154.
  6. R. C. Brewster and G. MacGillivray, The homomorphism factoring problem, Journal of Computational Mathematics and Computational Computing, 25 (1997), 33-53.
  7. R. C. Brewster and G. MacGillivray, Homomorphically full graphs, Discrete Applied Math., 66(1996), 23-31.
  8. R. C. Brewster, The complexity of colouring symmetric relational systems, Discrete Applied Math., 49(1994), 95-105.
  9. R. C. Brewster and G. MacGillivray, A note on restricted H-colourings, Information Processing Letters, 40(1991) 149-151.
  10. R. C. Brewster, E. J. Cockayne and C. M. Mynhardt, The irredundant Ramsey number s(3,6), Quaestiones Math. 13(1990) 141-158.
  11. R. C. Brewster, E. J. Cockayne and C. M. Mynhardt, Irredundant Ramsey numbers for graphs, J. Graph Theory 13(1989), 283-290.

Extended Abstracts:

  1. R. C. Brewster, P. Hell, On homomorphisms to edge-coloured cycles, Electronic Notes in Discrete Mathematics, 5 (July 2000).

Papers Submitted or In Preparation:

  1. R. C. Brewster, T. Feder, P. Hell, J. Huang, G. MacGillivray, Near unanimity functions and homomorphisms to reflexive graphs, submitted, 2003.
  2. Z. Bawar, R. C. Brewster, D. Marcotte, Duality theorems for small edge-coloured graphs, submitted 2003.
  3. R. C. Brewster, R. Dedic, F. Huard, J. Queen, Edge-coloured homomorphisms and the recognition of bound quivers, submitted, 2002.
  4. R. C. Brewster, P. Hell, R. Rizzi, Packing oriented stars in digraphs, in preparation.
  5. R. C. Brewster, P. Hell, Homomorphisms to edge-coloured cycles, in preparation.
  6. R. C. Brewster, G. MacGillivray, Building blocks for near unanimity varities, in preparation.





Contributions to the Training of Highly Qualified Personnel

Graduate Students Co-supervised

  1. Jeffery Queen, 2002--, M.Sc. (co-supervisor with I. Assem at Université de Sherbrooke)
  2. Sarah Pantel, 1997--1999, M.Sc. (co-supervisor with P. Hell at SFU)

Undergraduate Students

  1. Daniel Marcotte, Summer 2003;
  2. Wei Wang, Summer 2003;
  3. Jeffery Queen, Summer 2002;
  4. Daniel Marcotte, Summer 2002;
  5. Zaheer Bawar, Summer 2002;
  6. Jeffery Queen (with François Huard), Summer 2001;
  7. Renato Dedic (with François Huard), Summer 2001.

Postdoctoral Fellows Supervised

  1. Narayan Vikas, Summer 1998, Approximation Algorithms.




About this document ...

This document was generated using the LaTeX2HTML translator Version 2002 (1.62)

Copyright © 1993, 1994, 1995, 1996, Nikos Drakos, Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore, Mathematics Department, Macquarie University, Sydney.

The command line arguments were:
latex2html -split 0 publications

The translation was initiated by Rick Brewster on 2003-06-02

RETURN TO:
Rick's Homepage Bishop's University Computer Science Deparment Homepage Bishop's University Homepage