- Home
- Best Scientists - Mathematics
- Bruce Reed

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
52
Citations
11,865
175
World Ranking
2627
National Ranking
102

Mathematics
D-index
50
Citations
11,098
179
World Ranking
565
National Ranking
21

2009 - Fellow of the Royal Society of Canada Academy of Science

- Combinatorics
- Discrete mathematics
- Graph theory

His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Time complexity and Vertex. Bruce Reed regularly links together related areas like Bounded function in his Combinatorics studies. Bruce Reed interconnects A* search algorithm, Cubic graph and New digraph reconstruction conjecture in the investigation of issues within Vertex.

He has included themes like Fractional coloring, Brooks' theorem and Chordal graph in his Complete coloring study. His Complement graph study combines topics from a wide range of disciplines, such as Null graph and Graph factorization. His research integrates issues of Random regular graph, Trapezoid graph, Pathwidth, Modular decomposition and Random graph in his study of Indifference graph.

- A critical point for random graphs with a given degree sequence (1954 citations)
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence (700 citations)
- Finding odd cycle transversals (346 citations)

Bruce Reed focuses on Combinatorics, Discrete mathematics, Graph, Conjecture and Vertex. His study in Vertex, Time complexity, Degree, Disjoint sets and Chromatic scale falls within the category of Combinatorics. He works mostly in the field of Degree, limiting it down to concerns involving Random graph and, occasionally, Random regular graph.

His Discrete mathematics study frequently draws connections between adjacent fields such as Bounded function. In his study, Corollary is strongly linked to String graph, which falls under the umbrella field of Vertex. While the research belongs to areas of Chordal graph, Bruce Reed spends his time largely on the problem of Indifference graph, intersecting his research to questions surrounding Pathwidth and Bipartite graph.

- Combinatorics (105.14%)
- Discrete mathematics (64.43%)
- Graph (33.99%)

- Combinatorics (105.14%)
- Graph (33.99%)
- Discrete mathematics (64.43%)

His main research concerns Combinatorics, Graph, Discrete mathematics, Conjecture and Vertex. Many of his studies on Combinatorics involve topics that are commonly interrelated, such as Bounded function. As part of the same scientific family, Bruce Reed usually focuses on Graph, concentrating on Chromatic scale and intersecting with Treewidth.

His study in Independent set, Strong perfect graph theorem, Graph coloring, Neighbourhood and Complement graph is done as part of Discrete mathematics. His Strong perfect graph theorem research integrates issues from Structure, Indifference graph, Claw-free graph and Lonely runner conjecture. His Conjecture study incorporates themes from List coloring, Graph theory, Mathematics Subject Classification, Absolute constant and Linear number.

- A Proof of a Conjecture of Ohba (25 citations)
- Forcing a sparse minor (22 citations)
- How to determine if a random graph with a fixed degree sequence has a giant component (9 citations)

- Combinatorics
- Graph theory
- Discrete mathematics

His primary areas of investigation include Combinatorics, Graph, Conjecture, Degree and Discrete mathematics. Combinatorics is closely attributed to Bounded function in his research. His Intersection graph and Vertex study in the realm of Graph interacts with subjects such as struct and Plane convex.

His Conjecture study integrates concerns from other disciplines, such as List coloring, Complete graph, Mathematics Subject Classification, Absolute constant and Linear number. The study incorporates disciplines such as Minimum degree spanning tree and Spanning tree in addition to Degree. His research in Structured program theorem intersects with topics in Strong perfect graph theorem, Indifference graph, Chordal graph, Lonely runner conjecture and Claw-free 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)**

2592 Citations

The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Michael Molloy;Bruce Reed.

Combinatorics, Probability & Computing **(1998)**

972 Citations

Graph Colouring and the Probabilistic Method

Bruce Reed.

**(2001)**

550 Citations

Mick gets some (the odds are on his side) (satisfiability)

V. Chvatal;B. Reed.

foundations of computer science **(1992)**

435 Citations

Mick Gets Some (the Odds Are on His Side)

Vasek Chvátal;Bruce A. Reed.

foundations of computer science **(1992)**

389 Citations

Finding odd cycle transversals

Bruce Reed;Kaleigh Smith;Adrian Vetta.

Operations Research Letters **(2004)**

385 Citations

Acyclic coloring of graphs

Noga Alon;Colin Mcdiarmid;Bruce Reed.

Random Structures and Algorithms **(1991)**

299 Citations

Finding approximate separators and computing tree width quickly

Bruce A. Reed.

symposium on the theory of computing **(1992)**

261 Citations

Further algorithmic aspects of the local lemma

Michael Molloy;Bruce Reed.

symposium on the theory of computing **(1998)**

252 Citations

Paths, Stars and the Number Three

Bruce A. Reed.

Combinatorics, Probability & Computing **(1996)**

207 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

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

Something went wrong. Please try again later.