Matt’s primary research interests lie in graph theory and combinatorics, and in particular, topological graph theory, combinatorial additive number theory, and matroid theory.
You can see Matt here on the other side of the ledger.
completed her undergraduate studies in Zagreb (BEng) before moving to Montreal for her Masters and PhD (2004) under the supervision of Sue Whitesides. Her research area could be broadly described as graph structure theory and computational geometry, and has just recently moved to the School of Electrical Engineering and Computer Science at the
University of Ottawa. Vida is an avid tennis player and fan. In 2012 she fulfilled her life-long dream of attending the Australian Tennis Open in Melbourne. (This info is courtesy of her colleague, David Wood).
began his life in graph theory and combinatorial complexity in Oxford where he completed a DPhil (1986) under the supervision of Dominic Welsh. Today, his main research interests revolve around colourings of graphs, matroids, and cryptography. Graham is a member of the Discrete Mathematics Group at Monash University.
Graham also organises a historical tour of computing in Melbourne.
is one of the world leaders in the theory of association schemes and algebraic graph theory. Before he took his position at Worcester Polytechnic Institute, he studied at the University of Waterloo (PhD 1992 under Chris Godsil) and then took an Assistant Professorship at the University of Winnipeg.
According to Bill, “I have no hobbies, interests or talents. So I was thinking I’d be the perfect candidate for some reality show in Hollywood.”
is another descendant of Dominic Welsh (DPhil Oxford 2005), and is one of the young leaders in the theory of matroids. His other research interests include graph theory and complexity. Dillon is currently a Lecturer at Victoria University, Wellington.
Dillon’s “other career” is playing French Horn for the New Zealand Symphony Orchestra.
is an expert in the application of permutation groups to the study of symmetric combinatorial objects. He is a full professor at the University of Ljubljana where he studied for his undergraduate and postgraduate degrees. In between his PhD (2000) and his current position, he spent time on postdoctoral positions at the University of Ottawa and the University of Auckland.
is a Full Professor in the Department of Computer Science at Eötvös Loránd University, and his main research area is finite geometry. In particular, he has been one of the main protagonists in the study of blocking sets, caps, and algebraic curves in projective spaces. His PhD work was supervised by Ferenc Kárteszi, and then completed a Candidate of Sciences in 1991 under the auspices of László Lovász. In 2001, he received a Doctor of Science from the Hungarian Academy of Sciences.
Tamás is also well known for his cooking abilities.
is a prolific combinatorialist working across many areas of mathematics. These include random graphs, enumerative combinatorics, graph algorithms, probabilistic combinatorics, and underground mine optimisation. In 1979, he completed a PhD at the University of Newcastle (the Australian one) under the supervision of Robert Robinson. Currently, Nick is an Australian Laureate Fellow at Monash University, but before now, he held a Canada Research Chair at the University of Waterloo, and was an Associate Professor at the University of Melbourne.
Nick also likes to play croquet.