|
Nicholas Charles Wormald is an Australian mathematician and professor of mathematics at Monash University.
He specializes in probabilistic combinatorics, graph theory, graph algorithms, Steiner trees, web graphs, mine optimization, and other areas in combinatorics.
In 1979, he earned a Ph.D. in mathematics from the University of Newcastle with a dissertation entitled Some problems in the enumeration of labelled graphs
In 2006, he won the Euler Medal from the Institute of Combinatorics and its Applications.
He previously was the holder of the Canada Research Chair in Combinatorics and Optimization at the University of Waterloo.
In 2012, he was recognized with an Australian Laureate Fellowship for his achievements.
|
