2009 - Fellow of the Royal Society of Canada Academy of Science
His work in Combinatorics is not limited to one particular discipline; it also encompasses Clique. He frequently studies issues relating to Combinatorics and Clique. Bruce Reed conducted interdisciplinary study in his works that combined Line graph and Induced subgraph. He undertakes multidisciplinary investigations into Induced subgraph and Chordal graph in his work. Bruce Reed connects Chordal graph with Vertex (graph theory) in his study. He integrates several fields in his works, including Vertex (graph theory) and Line graph. His study ties his expertise on Simple graph together with the subject of Graph. Simple graph is closely attributed to Graph in his study. His Cograph research extends to the thematically linked field of 1-planar graph.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A critical point for random graphs with a given degree sequence
Michael Molloy;Bruce Reed.
Random Structures and Algorithms (1995)
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Michael Molloy;Bruce Reed.
Combinatorics, Probability & Computing (1998)
Graph Colouring and the Probabilistic Method
Bruce Reed.
(2001)
Mick gets some (the odds are on his side) (satisfiability)
V. Chvatal;B. Reed.
foundations of computer science (1992)
Finding odd cycle transversals
Bruce Reed;Kaleigh Smith;Adrian Vetta.
Operations Research Letters (2004)
Mick Gets Some (the Odds Are on His Side)
Vasek Chvátal;Bruce A. Reed.
foundations of computer science (1992)
Acyclic coloring of graphs
Noga Alon;Colin Mcdiarmid;Bruce Reed.
Random Structures and Algorithms (1991)
Finding approximate separators and computing tree width quickly
Bruce A. Reed.
symposium on the theory of computing (1992)
Further algorithmic aspects of the local lemma
Michael Molloy;Bruce Reed.
symposium on the theory of computing (1998)
Paths, Stars and the Number Three
Bruce A. Reed.
Combinatorics, Probability & Computing (1996)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Toronto
National Institute of Informatics
University of Oxford
Princeton University
Monash University
Carnegie Mellon University
Princeton University
Université Paris Cité
Alfréd Rényi Institute of Mathematics
Simon Fraser University
University of Florida
Federal Reserve Bank of St. Louis
World Bank
Nvidia (United States)
Beijing Jiaotong University
Lund University
Oak Ridge National Laboratory
National Institute for Materials Science
Wageningen University & Research
University of Naples Federico II
University of California, San Francisco
University of Porto
University of Amsterdam
University of Basel
Duke University
Aix-Marseille University