跳至中央區塊/Main Content :::
:::
野 仁

野 仁

特聘研究員

研究領域: Graph Theory, Probabilistic Combinatorics, Combinatorial Probability


Email : brucealanreed@gate.sinica.edu.tw

分機 : 710

MathSciNet : Link

Genealogy : Link

  • 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

  • S. Das, B. Reed, J. Skokan, "On Balance, To What Degree is Burr's Conjecture True? ", submitted, 2026 , Link
  • L. Addario-Berry, B. Reed, D.C. Yuan, "What Is The Probability That A Random graph with A Given Degree Sequence Is Connected? ", submitted , 2026 , Link
  • L. Addario-Berry, B. Reed, C. Yap , "Diameter and Mixing Time for Random Graphs with A Fixed Degree Sequence ", submitted, 2026 , Link
  • L. Addario-Berry, B. Reed, A. Scoot D. Wood , "A Logarithmic Bound on The Chromatic Number of The Associahedron ", Journal of Computational Geometry , 17 (1), 61-74, 2026 , Link, Link
  • M. Hatzel, C. H. Liu, B. Reed, S. Weiderrecht , "Bounds on Treewidth by Excluding Disjoint Unions of Cycles ", submitted , 2025 , Link
  • B.Reed and M. Stein , "Embedding Nearly Spanning Trees", Combinatorics, Probability, and Computing , 34 (6), 927-931, 2025 , Link, Link
  • Bruce Reed, Yelena Yuditsky, "The asymptotic χ-boundedness of hereditary families", submitted, 2025 , Link
  • Bruce Reed, Yelena Yuditsky, "Typical T-free Graphs", submitted, 2025 , Link
  • Bruce Reed, "The global structure of a typical graph without H as an induced subgraph when H is a cycle", submitted, 2025
  • J. Pascal Gollin, Kevin Hendrey, Sang-il Oum, Bruce Reed, "Linear Bounds on Treewidth from Excluded Minors", Electronic Journal of Combinatorics , 32 (4), 1-23, 2025 , Link, Link
  • Chun-Hung Liu, Bruce Reed, "Peaceful Colouring", Bulletin of Mathematics of Academia Sinica, 20 (2), 95-129, 2025 , Link, Link
  • Chun-Hung Liu, Bruce Reed, "Asymptotically Optimal Proper Conflict-free Colouring", Random Structures and Algorithms, 66 (3), 1-9, 2025 , Link, Link
  • John Iacono, Piotr Micek, Pat Morin, Bruce Reed, "Vertex Ranking of Degenerate Graphs", accepted by Electronic Journal of Combinatorics, 2024 , Link
  • Bruce Reed, Maya Stein, " Spanning trees in graphs which have a universal vertex II: a tight result", Journal of Graph Theory, , 797-821, 2023
  • Bruce Reed, Maya Stein, "Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result", Journal of Graph Theory, 737-783, 2023
  • Sebastian Gonzalez Hermosillo de la Maza, Seyyed Aliasghar Hosseini, Fiachra Knox, Bojan Mohar, Bruce Reed, "Cops and robbers on toroidal graphs", Theoretical Computer Science v. 857, 166-176, 2021
  • Daniel Figueiredo, Giulio Iacobelli, Roberto Oliveira, Bruce Reed, Rodrigo Ribeiro, "On a random walk that grows its own tree", Electronic Journal of Probability v. 26, 1-40, 2021
  • Tony Huynh, Bruce Reed, David R. Wood, Liana Yepremyan, "Notes on tree and path chromatic number", 2019-2020 MATRIX Annals, 489-498, 2021
  • Frédéric Havet, Bruce Reed, Maya Stein, David R. Wood, "A variant of the Erdos-Sos Conjecture", Journal of Graph Theory v. 94, 131-158, 2020
  • Sergey Norin, Bruce Reed, Andrew Thomason, David R. Wood, "A lower bound on the average degree forcing a minor", Electronic Journal of Combinatoircs v. 27, 2020
  • János Pach, Bruce Reed, Yelena Yuditsky, "Almost all string graphs are intersection graphs of planar convex sets", Discrete and Computational Geometry v. 63, 888-917, 2020
  • Luc Devroye, Vida Dujmović, Alan Frieze, Abbas Mehrabian, Pat Morin, Bruce Reed, "Notes on growing a tree in a graph", Random Structures and Algorithms v. 55, 290-312, 2019
  • Bruce Reed, Alex Scott, Paul Seymour, "Near domination in graphs", Journal of Combinatorial Theory A v. 165, 392-407, 2019
  • Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce Reed, "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
  • Xing Shi Cai, Guillem Perarnau, Bruce Reed, Adam Bene Watts, "Acyclic edge colourings of graphs with large girth", Random Structures and Algorithms v. 50, 511-533, 2017
  • Jonas T. Witt, Marco E. Lübbecke, Bruce Reed, "Polyhedral results on the stable set polytopes of graphs containing even or odd pairs", Mathematical Programming v. 171, 519-522, 2017
  • Bojan Mohar, Bruce Reed, David R. Wood, "Colourings with bounded monochromatic components in graphs of given circumference", Australasian Journal of Combinatorics v. 69, 236-242, 2017
  • Guillem Perarnau, Bruce Reed, "Existence of spanning F-free subgraphs with large minimum degree", Combinatorics Probability and Computing v. 28, 448-467, 2017
:::