Bruce Reed at the Bellairs Research Institute, 2015

Bruce Alan Reed FRSC is a Canadian mathematician and computer scientist, a former Canada Research Chair in Graph Theory at McGill University.[1][2] His research is primarily in graph theory.[2] He is a distinguished research fellow of the Institute of Mathematics in the Academia Sinica, Taiwan,[3] and an adjunct professor at the University of Victoria in Canada.[4]

Academic career

Reed earned his Ph.D. in 1986 from McGill, under the supervision of Vašek Chvátal.[5] Before returning to McGill as a Canada Research Chair, Reed held positions at the University of Waterloo, Carnegie Mellon University, and the French National Centre for Scientific Research.[6]

Reed was elected as a fellow of the Royal Society of Canada in 2009,[7] and is the recipient of the 2013 CRM-Fields-PIMS Prize.[8]

In 2021 he left McGill, and subsequently became a researcher at the Academia Sinica and an adjunct professor at the University of Victoria.[1][3][4]

Research

Reed's thesis research concerned perfect graphs.[5] With Michael Molloy, he is the author of a book on graph coloring and the probabilistic method.[9] Reed has also published highly cited papers on the giant component in random graphs with a given degree sequence,[MR95][MR98a] random satisfiability problems,[CR92] acyclic coloring,[AMR91] tree decomposition,[R92][R97] and constructive versions of the Lovász local lemma.[MR98b]

He was an invited speaker at the International Congress of Mathematicians in 2002.[10] His talk there concerned a proof by Reed and Benny Sudakov, using the probabilistic method, of a conjecture by Kyoji Ohba that graphs whose number of vertices and chromatic number are (asymptotically) within a factor of two of each other have equal chromatic number and list chromatic number.[RS02]

Selected publications

Articles

Books

References

  1. 1 2 "McGill School of Computer Science", McGill.ca, retrieved 28 September 2022
  2. 1 2 Chairholders: Bruce A. Reed, Canada Research Chairs, retrieved 2012-10-07.
  3. 1 2 "Bruce Alan Reed", Research and specialist staff, Institute of Mathematics, Academia Sinica, retrieved 2023-11-07
  4. 1 2 "Discrete mathematics", Mathematics & Statistics, University of Victoria, retrieved 2023-11-07
  5. 1 2 Bruce Reed at the Mathematics Genealogy Project
  6. ↑ Past members, Pacific Institute for the Mathematical Sciences, retrieved 2012-10-07.
  7. ↑ "Three McGill researchers elected RSC Fellows", McGill Reporter, October 1, 2009, archived from the original on March 3, 2016, retrieved October 7, 2012
  8. ↑ Bruce Reed announced as 2013 CRM/Fields/PIMS Prize recipient, Pacific Institute for the Mathematical Sciences, retrieved 2012-12-30.
  9. ↑ Kayll, P. Mark (2003). Graph Colouring and the Probabilistic Method. Mathematical Reviews, MR1869439.
  10. ↑ ICM Plenary and Invited Speakers since 1897, International Mathematical Union, archived from the original on 2017-11-24, retrieved 2015-10-01.
  11. ↑ Reviews of Graph Colouring and the Probabilistic Method:
    • Fiamčik, Jozef, zbMATH, Zbl 0987.05002{{citation}}: CS1 maint: untitled periodical (link)
    • Kayll, P. Mark (2003), Mathematical Reviews, MR 1869439{{citation}}: CS1 maint: untitled periodical (link)
    • Alon, Noga (March 2003), SIAM Review, 45 (1): 131–132, JSTOR 25054375{{citation}}: CS1 maint: untitled periodical (link)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.