Nick Wormald

Nicholas Charles Wormald FAA 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.[1]

In 1979, Wormald earned a Ph.D. in mathematics from the University of Newcastle with a dissertation entitled Some problems in the enumeration of labelled graphs[2]

In 2006, he won the Euler Medal from the Institute of Combinatorics and its Applications. He has held the Canada Research Chair in Combinatorics and Optimization at the University of Waterloo.[3] In 2012, he was recognized with an Australian Laureate Fellowship for his achievements.[1] In 2017, he was elected as a Fellow of the Australian Academy of Science.[4]

In 2018, Wormald was an invited speaker at the International Congress of Mathematicians in Rio de Janeiro.

Selected publications

References
  1. "Professor Nicholas Wormald – Advances in the analysis of random structures and their applications" (PDF). Australian Government – Australian Research Council. Archived from the original (PDF) on 15 October 2012. Retrieved 20 November 2012.
  2. Nick Wormald at the Mathematics Genealogy Project
  3. Canada Research Chairs – Nicholas Charles Wormald, retrieved 2012-11-21.
  4. Fellow of the Australian Academy of Science, retrieved 2017-07-13.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.