Charles Colbourn

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Charles Joseph Colbourn (born October 24, 1953) is a Canadian computer scientist and mathematician, whose research concerns graph algorithms, combinatorial designs, and their applications. From 1996 to 2001 he was the Dorothean Professor of Computer Science at the University of Vermont; since then he has been a professor of Computer Science and Engineering at Arizona State University.[1][2][3]

Colbourn was born on October 24, 1953, in Toronto, Ontario, Canada; despite working in the United States since 1996 he retains his Canadian citizenship.[1] He did his undergraduate studies at the University of Toronto, graduating in 1976; after a masters degree at the University of Waterloo, he returned to Toronto for a Ph.D., which he received in 1980 under the supervision of Derek Corneil.[1][4] He has held faculty positions at the University of Saskatchewan, University of Waterloo, University of Vermont, and Arizona State University, as well as visiting positions at several other universities. He has been one of three editors-in-chief of the Journal of Combinatorial Designs since 1992.[1][5]

In 2004, the Institute of Combinatorics and its Applications named Colbourn as that year's winner of their Euler Medal for lifetime achievements in combinatorics.[1][6]

References[edit]

  1. ^ a b c d e Curriculum vitae from Colbourn's web site, retrieved 2011-03-26.
  2. ^ EPSCor newsletter, Fall 1997, mentioning Colbourn's chair at the University of Vermont.
  3. ^ ASU faculty listing, retrieved 2011-03-26.
  4. ^ Charles Joseph Colbourn at the Mathematics Genealogy Project
  5. ^ Journal of Combinatorial Designs web site, Wiley Periodicals, Inc., retrieved 2011-03-26.
  6. ^ Bulletin of the Institute of Combinatorics and its Applications, volumes 43–45, 2005; Proceedings of the 36th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium 172–173, 2005.