Recent Theses

Copies of most theses are available in the Mathematics collection of SFU Summit.

2017

Degree Student Name Thesis Title Supervisor
PhD Ross Churchley Odd Disjoint Trails and Totally Odd Graph Immersions             Mohar
MSc Benjamin Moore Rooted Graph Minors and Reducibility of Graph Polynomials Yeats
PhD Iain Crump Graph Invariants with Connections to the Feynman Period in phi^4 Theory Yeats

2016

Degree Student Name Thesis Title Supervisor
PhD Justin Chan Three Problems Involving Permutations  Jedwab
MSc Akbar Rafiey Algorithmic Aspects of some Vertex Ordering Problems   Stacho
MSc Lucien Lapierre Vectorial Bent Functions in Characteristic Two Lisonek

2015

Degree Student Name Thesis Title Supervisor
PhD Daryl Funk On Excluded Minors and Biased Graph Representations of Frame Matroids
DeVos
PhD

Ashok Rajaraman

Variants of the Consecutive Ones Property: Algorithms, Computational Complexity and Applications to Genomics

Chauve
PhD Krystal Guo
Simple eigenvalues of graphs and digraphs Mohar
PhD Tomas Boothby Some Results on Structure in Graphs and Numbers DeVos

2014

Degree Student Name Thesis Title Supervisor
MSc Stephen Melczer    
Variants of the Kernel Method for Lattice Path Models Mishna
MSc
Bradley Jones  
On tree hook length formulae, Feynman rules and B-series Yeats
PhD
Sophie Burrill
A generating tree approach to k-nonnesting arc diagrams Mishna/Yen
MSc
Yue Zhao
Combinatorial Hopf Algebras On Generating Trees and Certain Generating Graphs Yeats

MSc Wei Chen Enumeration of Set Partitions Refined by Crossing and Nesting Numbers Mishna/Yen
MSc Yian Xu Generalized Thrackles and Graph Embeddings Goddyn


2013

Degree Student Name Thesis Title Supervisor
MSc Bahar Behsaz    
Computational Aspects of DNA Self-Assembly Systems at    Temperature 1  
Stacho
PhD Azhvan Sheik Ahmady Integral Cayley Graphs Mohar
MSc
Maria Tamayo Algorithms for finding Tucker Patterns
Chauve & Stephen
MSc Amy Wiebe Constructions of complex equiangular lines Jedwab

2012

Degree Student Name Thesis Title Supervisor
MSc Iain Crump Forbidden minors for 3-connected graphs with no
non-splitting 5-configurations
Yeats
PhD Petr Skoda

Obstructions for embedding graphs into surfaces

Mohar
MSc Jane Wodlinger Costas Arrays, Golomb Rulers and Wavelength Isolation
Sequence Pairs
Jedwab
MSc Samuel Johnson

Analytic Combinatorics of Planar Lattice Paths

Mishna
PhD Lino Demasi Rooted Minors iand delta-Wye transformations Mohar

2011

Degree Student Name Thesis Title Supervisor
MSc
Nathan Singer
Topological Colouring Bounds and Graph Structure
Mohar
MSc
Ahmad Mahmoody Ghaidary
Tractability Results for the Multichromosomal DCJ Median Problem
Chauve
MSc 
Ashok Rajaraman 
Inference of Ancestral Protein-Protein Interactions Using Methods
From Algebraic Statistics
Chauve
MSc Hui Yi Lu Partial Spreads and Hyperbent funtions in Odd Characteristic
Lisonek
MSc Timothy Yunsun Dedekind Numbers and Related Sequences Stephen
MSc Mehrnoush Malekesmaeili On Certificates that a Matrix does not have the consecutive ones
property.
Stephen
PhD Ararat Harutyunyan Brooks-Type results for colouring of Digraphs Mohar

2010

Degree Student Name Thesis Title Supervisor
MSc Mariolys Rivas D-finite Symmetric Functions Marni Mishna
Ph.D. Karel Casteels The combinatorial structure of the prime spectrum of quantum matrices Jason Bell
MSc Andrea Spencer Edge-choosability of Cubic Graphs and the Polynomial Method
Luis Goddyn, Ladislav Stacho
PhD Jean-Philippe Doyon Algorithms for gene family evolution

Cedric Chauve,
Sylvie Hamel (U. Montréal),
Hervé Philippe (U. Montréal)

MSc Aki Avis 3-phase Golay Triads

Jonathan Jedwab

PhD

Maryam Verdian-Rizi

Triangulations of the Torus with at most two odd vertices: structure and coloring Luis Goddyn
MSc Samson Bassett Low memory graph traverlal Ladislav Stacho

2009

MSc Sophie Burrill Nesting and crossings in four combinatorial families Marni Mishna
MSc Jacob Post Combinatorics of arc diagrams, Ferrers fillings, Young tableaux and lattice paths Pavol Hell and Cedric Chauve
MSc Vivija You On matrices that do not have the Consecutive Ones Property Cedric Chauve
MSc James Parks A Dixmier-Moeglin equivalence for skew Laurent polynomial rings Jason Bell
MSc Christine Stoll
Self-assembly systems Ladislav Stacho
PhD Hayri Ardal Some coloring problems in Ramsey Theory Ladislav Stacho

2008

MSc Richard Gibson Quaternary Golay sequences pairs Jonathan Jedwab
MSc Javad Ebrahimi-Boroojeni Sum of the Laregest Eigenvalues of Symmetric Matrices Bojan Mohar
MSc

Pinar Colak (nee Pekcagliyan)

Primitivity of finitely presented monomial algebras Jason Bell
PhD

Mahdad Khatirinejad Fard

Structures of Lines in Complex Spaces Petr Lisonek

2007

MSc Kseniya Garaschcuk On Binary and Ternary Kloosterman Sums Petr Lisonek
MSc David Laferriere Classification of Walks in Wedges Marni Mishna
PhD Mohammad Ghebleh Theorems and Computations in Circular Colourings of Graphs Luis Goddyn
PhD Laura Chavez-Lomeli Circular Flow and Circular Chromatic number in the Matroid Context Luis Goddyn

Ancient times

2006
MSc
Jodie Wallis
Prescribed Automorphism Groups and Two Problems in Galois Geometries
Lisonek
2006
MSc Nadia Nosrati
Domination in Graphs
Stacho
2006
MSc Tim Mott
Online Routing Algorithms on Geometric graphs with convex substructures
Stacho
2002
MSc Mahdad Khatirinejadfard
Binary linear codes and caps in finite projective geometries
Lisonek
2002 MSc Bruce Rout
An examination fo Resourcing and scheduling  withing the RCMP
Goddyn
2002 MSc Justin Travis Gray Non-Cayley Vertex-transitive Graphs Alspach
2001 MSc John Stardom Metaheuristics and the Search for Covering and Packing Arrays Goddyn
2001 MSc Shabnam Kavousian Approaches to the list homomorphism problem for interval graphs Hell
2001 MSc Daniel Dyer 2-Coloured path decomposition Heinrich
2000 MSc Marni Mishna Cayley Graph Enumeration Alspach
1999 MSc Sarah Pantel Graph Packing Problems Hell
1999 MSc Marsha Anderson Decomposing Graphs into Fixed Length Cycles Alspach
1998 MSc Nelly Simoes When Combinatorics meets Cryptography (A modern tale about Alice and Bob) Heinrich
1998 MSc Yudi Setyawan Combinatorial number theory: Results of Hilbert, Schur, Folkman and Hindman Brown
1994 MSc Mateja Sajna Half-transitive graphs Alspach
1993 MSc P. Gvozdjak Highly extendable graphs without short cycle Goddyn
1992 MSc J. Ales ETA-Perfect Graphs Alspach
1991 MSc Paul Meijer Connectivities and diameters of circulant graphs Alspach
1991 MSc Xudong FU Matroids with the circuit cover property Goddyn
1991 MSc Helen Verall Hamiltion Decompositons of Complete 3-Uniform Hypergraphs Heinrich
1990
MSc
Peder Bolstad
The Oberwolfach Problem: A History and some new results
Alspach
1989 PhD Haluk Oral Self-Dual Codes and Graphs Godsil
1989
MSc
Susan Hamm
Resolvable and Near resolvable Oriented 3- and 4- cycle decompositions
of the complete symmetric digraphs
Heinrich
1989
MSc
Susan Marshall
Cycle Decompositions of Complete graphs
Alspach
1988 PhD H. Zhou Homomorphism properties of grpah products Hell
1987
MSc
Ekambaram
Variations on van der Waerden's theorem and the Hales-Jewett Theorem
Brown
1987 PhD G. Nonay Results on the covering of 2-paths by cycles Heinrich
1986
MSc
M. Zobi
Arithmetic progressions  in Space Sets
Freedman
1986
MSc
H. Hermary
Rigidity of Graphs
Godsil
1987 PhD L. Varga On basic parametric relations for incidence systems Alspach
1986 PhD C. Zhang Longest Cycle in Graphs Alspach
1985
MSc
P. Ng
On path decompositions of complete graphs
Alspach
1984
MSc
B. McCuaig
Cycles and connectivity in graphs
Alspach
1984
MSc
T. Raymond
A sruvey of 1-factorizations
Alspach
1983
MSc
D. Poon
Sperner's theorem and extremal properties of finite sets
Alspach
1983
MSc
G. Nonay
Path and cycle decompositions of complete multigraphs
Heinrich
1983
MSc
L. So
A survey on sequenceable groups and their applications
Alspach
1982
MSc
L. Lee
On Hamiltonian-connected graphs
Alspach
1980
MSc
P. Brearley
Ramsey's theorem for spaces
Brown
1980 PhD E. Durnberger Discontinuous homeomorphism groups of planar surfaces Alspach
1979 PhD B. N.Varma Some Decomposition problems for complete graphs Alspach
1977
MSc
G. Hahn
Anti-Ramsey Numbers
Alspach
1976
MSc
R. Mullins
On some applications of combinatory logic and lambda-conversion
in studies of recursion and of the semantics of programming languages
Harrop
1974
MSc
R. Sutcliffe
Automorphism groups of graphs
Alspach