Charles Colbourn

Charles Joseph Colbourn ( born October 24, 1953 in Toronto ) is a Canadian mathematician and computer scientist who deals with combinatorics.

Colbourn studied at the University of Toronto with a bachelor's degree in 1976 and at the University of Waterloo with a Master's degree in 1978. 1980, it was his doctorate at the University of Toronto with Derek Corneil in computer science (The complexity of graph isomorphisms and related problems ). In 1980 he became assistant professor of computer science at the University of Saskatchewan, in 1984 professor at the University of Waterloo, where he was Executive Board of the Faculty since 1993. He became a professor at the University of Vermont in 1996. Since 2001 he is a professor at Arizona State University.

It deals with, among other combinatorial design theory ( Combinatorial Design Theory) with applications in computer science and cryptography, with graph algorithms and the analysis of networks in terms of reliability and performance.

He has been a visiting professor and visiting scientist at the DIMACS Rutgers University, the Institute of Mathematics and its Applications in Minneapolis, at the University of Auckland in New Zealand, Curtin University in Perth at Carleton University and Simon Fraser University.

In 1990 he was a founding member of the Institute of Combinatorics and its Applications. Since 1993 he is co-editor of the Journal of Combinatorial Designs.

In 2003 he was awarded the Euler Medal with Peter Cameron.

He has been married since 1985 and has one daughter.