Reed, Bruce Alan
Distinguished Research Fellow
Research Fields: Graph Theory, Probabilistic Combinatorics, Combinatorial Probability
Email : brucealanreed@gate.sinica.edu.tw
Extension : 710
- Ph.D. in Computer Science McGill University 1986
- B.S. in Mathematics & Computer Science McGill University 1983
- Full Professor, School of Computer Science McGill University 2001/7 - 2021/1
- Directeur de Recherche CNRS, France 2000/10 - 2018/10
- Charge de Recherche CNRS, France 1993/9 - 2000/9
- Visiting Associate Professor, Department of Mathematics Carnegie Mellon University 1993/7 - 1995/6
- Visiting Researcher, SOCS McGill University 1992/9 - 1993/6
- Von Humboldt Fellow, Institut fur Diskrete Mathematik Universitat Bonn 1991/9 - 1992/9
- Assistant Professor, Dept. of Combinatorics & Optimization University of Waterloo 1987/7 - 1991/9
- Postdoctoral Fellow, Discrete Mathematics Group Bell Communications Research 1986/9 - 1987/7
- 2014, Humboldt Research Prize
- 2013, Fields Institute Fellow
- 2013, Best Paper: ACM-SIAM Symposium on Discrete Mathematics
- 2013, CRM/Fields/PIM Prize
- 2009, Fellow of the Royal Society of Canada
- 2008-2015, Canada Research Chair
- 2002, Invited lecture, International Congress of Mathematics, Beijing China
- 2001-2008, Canada Research Chair
- (with Stein M.) " Spanning trees in graphs which have a universal vertex II: a tight result", Journal of Graph Theory, , 797-821, 2023
- (with Stein M.) "Spanning trees in graphs which have a universal vertex II: a tight result", Journal of Graph Theory, 737-783, 2023
- (with de la Maza S., Hosseini S., Knox F., Mohar B.) "Cops and robbers on toroidal graphs", Theoretical Computer Science v. 857, 166-176, 2021
- (with Figuereido D., Iacobelli G., Oliveira R., Ribeiro R.) "On a random walk that grows its own tree", Electronic Journal of Probability v. 26, 1-40, 2021
- (with Huynh T., Wood D., Yepremyan L.) "Notes on tree and path chromatic number", 2019-2020 MATRIX Annals, 489-498, 2021
- (with Havet F., Stein M., Wood D.) "A variant of the Erdos-Sos Conjecture", Journal of Graph Theory v. 94, 131-158, 2020
- (with Norin S., Thomason A., Wood D.) "A lower bound on the average degree forcing a minor", Electronic Journal of Combinatoircs v. 27, 2020
- (with Pach J., Yuditsky L.) "Almost all string graphs are intersection graphs of planar convex sets", Discrete and Computational Geometry v. 63, 888-917, 2020
- (with Devroye L., Dujmovic V., Frieze A., Mehrabian A., Morin P.) "Notes on growing a tree in a graph", Random Structures and Algorithms v. 55, 290-312, 2019
- (with Scott A., Seymour P.) "Near domination in graphs", Journal of Combinatorial Theory A v. 165, 392-407, 2019
- (with Joos F., Perarnau G., Rautenbach D.) "How to determine if a random graph with a fixed degree sequence has a giant component", Probability Theory and Related Fields v. 170, 263-310, 2018
- (with Cai X., Perarnau G., Watts A.) "Acyclic edge colourings of graphs with large girth", Random Structures and Algorithms v. 50, 511-533, 2017
- (with Lubbecke M., Witt J.) "Polyhedral results on the stable set polytopes of graphs containing even or odd pairs", Mathematical Programming v. 171, 519-522, 2017
- (with Mohar B., Wood D.) "Colourings with bounded monochromatic components in graphs of given circumference", Australasian Journal of Combinatorics v. 69, 236-242, 2017
- (with Perarnau G.) "Existence of spanning F-free subgraphs with large minimum degree", Combinatorics Probability and Computing v. 28, 448-467, 2017