I am a mathematician, with a PhD from the School of Mathematics and Physics at the University of Queensland. My research lies in the fields of graph decompositions, and also in combinatorial topology.

As a student I have played integral roles in the organisation of various social functions as a part of the Mathematics Students Society. I was a member of the Host Scientific Committee for the 2013 International Olympiad in Informatics and am currently involved with the Queensland Informatics & Programming Club to train high school students in informatics.

Combinatorial topology

• Development of Regina, a mathematical software suite for 3-manifold topologists
• Census enumeration algorithms, and their complexity
• Spine codes of 3-manifolds
• Properties of Pachner graphs

Published

1. W. Pettersson. Computational Graph Theory, PhD Thesis Oct 17 2014; (Available online)
2. B. Burton and W. Pettersson. Fixed parameter tractable algorithms in combinatorial topology, Lecture Notes in Computer Science vol. 8591, 2014, pp.200-311. (Publisher, arXiv)
3. D. Bryant, P. Danziger and W. Pettersson. Bipartite 2-factorisations of complete multipartite graphs, Journal of Graph Theory 2014; doi: 10.1002/jgt.21806 (Publisher)
4. D. Bryant, D. Horsley, and W. Pettersson. Cycle decompositions V: Complete graph into cycles of arbitrary lengths, Proceedings of the London Mathematical Society 2014; doi: 10.1112/plms/pdt051 (Publisher, arXiv)

Submitted

4. B. Burton and W. Pettersson. An edge-based framework for enumerating 3-manifold triangulations. (arXiv)

In preparation

4. D. Bryant and W. Pettersson. 2-factorisations of circulant graphs.

At The University of Queensland

As a teaching assistant:

• 2014 : MATH4303 Advanced Combinatorics
• 2011-2014 : MATH3301 Graph Theory and Design Theory
• 2010-2014 : MATH3302 Coding and Cryptography
• 2010-2014 : MATH1061 Discrete Mathematics
• 2011-2013 : MATH3500 Problems and Applications in Modern Mathematics
• 2011 : MATH4302 Combinatorial Designs
• 2010 : MATH3306 Set Theory and Logic