39th
Australasian Conference on Combinatorial

Mathematics
and
Combinatorial Computing
The
University of
Queensland

Home | About the speakers | Accommodation | Local information | Program | Student Information | Registration | Abstracts |

Peter
Cameron

Peter Cameron is currently at the University of St Andrews, and is an emeritus professor at Queen Mary University of London where he spent 26 years. He works in combinatorics, algebra and model theory, and in particular on the connection between structures and their automorphism groups; he introduced the term "oligomorphic" for a class of infinite permutation groups which coincide with the automorphism groups of countably categorical structures. Among other recent concerns are the connection between statistical optimality criteria and Laplacian spectra of graphs.

Despite his recent move to the home of golf, he has not taken up this sport, but enjoys walking and playing the guitar.

Peter Cameron is currently at the University of St Andrews, and is an emeritus professor at Queen Mary University of London where he spent 26 years. He works in combinatorics, algebra and model theory, and in particular on the connection between structures and their automorphism groups; he introduced the term "oligomorphic" for a class of infinite permutation groups which coincide with the automorphism groups of countably categorical structures. Among other recent concerns are the connection between statistical optimality criteria and Laplacian spectra of graphs.

Despite his recent move to the home of golf, he has not taken up this sport, but enjoys walking and playing the guitar.

Saad
El-Zanati

Saad El-Zanati earned his Ph.D. from Auburn University in 1991 under the supervision of Chris Rodger. In the same year, he joined the discrete mathematics group at Illinois State University. He was promoted to the rank of professor in 2000 and was named distinguished professor in 2014. Saad’s research focuses on several areas in graph theory and combinatorial design theory. He has done extensive work on cyclic graph designs and on vector space partitions.

In his spare time, Saad takes care of a rural 32-acre homestead with honeybees, chickens, and an absurdly large garden.

Saad El-Zanati earned his Ph.D. from Auburn University in 1991 under the supervision of Chris Rodger. In the same year, he joined the discrete mathematics group at Illinois State University. He was promoted to the rank of professor in 2000 and was named distinguished professor in 2014. Saad’s research focuses on several areas in graph theory and combinatorial design theory. He has done extensive work on cyclic graph designs and on vector space partitions.

In his spare time, Saad takes care of a rural 32-acre homestead with honeybees, chickens, and an absurdly large garden.

Nevena
Francetić

Nevena Francetić is a research fellow at the School of Mathematical Sciences, Monash University. She finished her PhD and MSc at the University of Toronto under supervision of Prof. Eric Mendelsohn. Nevena's research interests are broadly in combinatorial design theory. She finds covering arrays and related structures, hypergraphs and decomposition problems especially intriguing.

Nevena has a sweet tooth. At work, she has been spreading her love of Tim-Tams to her colleagues.

Nevena Francetić is a research fellow at the School of Mathematical Sciences, Monash University. She finished her PhD and MSc at the University of Toronto under supervision of Prof. Eric Mendelsohn. Nevena's research interests are broadly in combinatorial design theory. She finds covering arrays and related structures, hypergraphs and decomposition problems especially intriguing.

Nevena has a sweet tooth. At work, she has been spreading her love of Tim-Tams to her colleagues.

Catherine
Greenhill

Catherine Greenhill started her academic career as an undergraduate at the University of Queensland, before obtaining a D.Phil. from the University of Oxford (1992). She held postdoctoral positions at the University of Leeds and at the University of Melbourne, before joining UNSW in 2003. Today she is an Associate Professor in the School of Mathematics and Statistics, UNSW. Catherine's research interests lie in asymptotic, probabilistic and algorithmic combinatorics.

Believe it or not, Catherine knows how to prepare vegan meringue from the liquid that comes out of a tin of chickpeas.

Catherine Greenhill started her academic career as an undergraduate at the University of Queensland, before obtaining a D.Phil. from the University of Oxford (1992). She held postdoctoral positions at the University of Leeds and at the University of Melbourne, before joining UNSW in 2003. Today she is an Associate Professor in the School of Mathematics and Statistics, UNSW. Catherine's research interests lie in asymptotic, probabilistic and algorithmic combinatorics.

Believe it or not, Catherine knows how to prepare vegan meringue from the liquid that comes out of a tin of chickpeas.

Penny
Haxell

Penny Haxell received her PhD in pure mathematics from the University of Cambridge in 1993. In the same year, she joined the Department of Combinatorics and Optimization at the University of Waterloo, becoming a full professor in 2004. She spent one year as a visiting professor at Bell Laboratories in Murray Hill, NJ in 2002. Her research interests focus on extremal combinatorics and graph theory.

Penny enjoys travelling and is excited about her first trip to Australia.

Penny Haxell received her PhD in pure mathematics from the University of Cambridge in 1993. In the same year, she joined the Department of Combinatorics and Optimization at the University of Waterloo, becoming a full professor in 2004. She spent one year as a visiting professor at Bell Laboratories in Murray Hill, NJ in 2002. Her research interests focus on extremal combinatorics and graph theory.

Penny enjoys travelling and is excited about her first trip to Australia.

Jonathan
Jedwab

Jonathan Jedwab is a professor of mathematics at Simon Fraser University, Canada. His research interests are to combine combinatorial, algebraic, and analytical techniques to solve classical and emerging problems of digital communications. Before moving to the magical city of Vancouver in 2003, he worked for 14 years at Hewlett-Packard Research Labs in the United Kingdom where he used discrete mathematics to solve practical digital communications problems. He is a named inventor on 25 granted patents in information processing.

Jonathan looks forward to the latest Dilbert cartoon every morning.

Jonathan Jedwab is a professor of mathematics at Simon Fraser University, Canada. His research interests are to combine combinatorial, algebraic, and analytical techniques to solve classical and emerging problems of digital communications. Before moving to the magical city of Vancouver in 2003, he worked for 14 years at Hewlett-Packard Research Labs in the United Kingdom where he used discrete mathematics to solve practical digital communications problems. He is a named inventor on 25 granted patents in information processing.

Jonathan looks forward to the latest Dilbert cartoon every morning.

Gordon
Royle

In the distant past, Gordon did his PhD at UWA under the joint supervision of Cheryl Praeger and Brendan McKay. After a short time overseas, first at Waterloo, and then at Vanderbilt, Gordon returned to Perth where he has subsequently spent the majority of his working life. His research interests include graph theory, in particular algebraic graph theory, matroid theory, and finite geometry, with a particular emphasis on large-scale computation for mathematical exploration and specimen-gathering.

His spare time is mostly spent playing grass-court tennis, swimming, and providing a free 7-day taxi service to his daughters.

In the distant past, Gordon did his PhD at UWA under the joint supervision of Cheryl Praeger and Brendan McKay. After a short time overseas, first at Waterloo, and then at Vanderbilt, Gordon returned to Perth where he has subsequently spent the majority of his working life. His research interests include graph theory, in particular algebraic graph theory, matroid theory, and finite geometry, with a particular emphasis on large-scale computation for mathematical exploration and specimen-gathering.

His spare time is mostly spent playing grass-court tennis, swimming, and providing a free 7-day taxi service to his daughters.

Charles
Semple

Charles Semple started out as a secondary school teacher before completing his PhD at Victoria University of Wellington under the supervision of Geoff Whittle. He works in matroid theory and phylogenetics, and publishes in journals ranging from pure mathematics and theoretical computer science to mathematical and evolutionary biology. Charles is a Professor of Mathematics at the University of Canterbury and a Fellow of the Royal Society of New Zealand.

Charles doesn’t mind the odd off-road run.

Charles Semple started out as a secondary school teacher before completing his PhD at Victoria University of Wellington under the supervision of Geoff Whittle. He works in matroid theory and phylogenetics, and publishes in journals ranging from pure mathematics and theoretical computer science to mathematical and evolutionary biology. Charles is a Professor of Mathematics at the University of Canterbury and a Fellow of the Royal Society of New Zealand.

Charles doesn’t mind the odd off-road run.