Generate a tailored SOP for Dr. Joseph Sawada. Improve your application with a focused, well-structured draft.
Joseph Sawada is a professor in the School of Computer Science at the University of Guelph. His research primarily focuses on combinatorial algorithms, including the study of de Bruijn sequences, universal cycles, and Gray codes. He aims to gain a thorough understanding of various combinatorial objects, such as necklaces, free plane trees, and complex structures like stamp foldings and vertex orderings. Notably, he investigates questions related to efficiently listing non-isomorphic instances of these objects and explores interesting algorithms that arise in this context. His work has been published in several notable journals, and he enjoys tackling fun combinatorial problems that, despite their complexity, can often have surprisingly straightforward solutions. Sawada's contributions are characterized by his collaborative research with co-authors on topics like flipping pancakes and constructions in graph theory, regularly appearing in academic publications.
Department of Clinical Studies. Offers MSc by thesis (2 years) and MSc by coursework (1 year).