J O E     S A W A D A
[   Home   ] [   Publications and Research   ] [   Algorithm Code   ]
 
 
Brief Bio: I received my PhD from the University of Victoria. Following this, I spent two years on an NSERC post-doc visiting Charles University in the Czech Republic, the University of Sydney in Australia, and the University of Toronto. I have been a faculty member at the University of Guelph since 2003.

I am a co-founder of FreshBooks, a Toronto tech company employing many Guelph co-ops and graduates.

 
Research Interests: A variety of combinatorial objects from necklaces to free plane trees to stamp foldings to vertex orderings of chordal graphs are investigated. No interesting object is left behind. The goal is to gain a more thorough understanding of the object in question by considering how to efficiently list all non-isomorphic instances of that object. Another interesting question that arises, is whether or not each instance can be listed so that there is a constant amount of change between successive objects. Such algorithms are called Gray codes.

Delving into graphs also involves careful study of the structure of the specific class of graphs under investigation. Complexity results are of interest as well as recognition algorithms and forbidden sub-structure characterizations.

The study of de Bruin cycles and universal cycles are of particular interest lately.

 
Teaching:
  CIS 3150 Theory of Computation (courselink) 2016 (F)
  CIS 1500 Introduction to Programming (courselink) 2016 (W)
 
Contact:
Associate Professor
School of Computer Science
University of Guelph
Guelph, Ontario, Canada, N1G 2W1
217 Reynolds

jsawada@uoguelph.ca
519-824-4120 x53277