Colin J. H. Mcdiarmid

Colin J. H. Mcdiarmid's AcademicInfluence.com Rankings

Mathematics

#7170

Historical Rank

Combinatorics

#62

Historical Rank

Measure Theory

#810

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Colin J. H. Mcdiarmid Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Colin J. H. Mcdiarmid's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Surveys in Combinatorics, 1989: On the method of bounded differences (1989) (1820)
Concentration (1862) (702)
Colouring random graphs (1975) (378)
Acyclic Coloring of Graphs (1991) (235)
On integer points in polyhedra (1992) (211)
SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing (1991) (207)
Algorithmic theory of random graphs (1997) (150)
Random planar graphs (2005) (141)
Channel assignment and weighted coloring (2000) (123)
Small transversals in hypergraphs (1992) (115)
Vertex-Colouring Edge-Weightings (2007) (102)
On the maximum queue length in the supermarket model (2006) (95)
The Solution of a Timetabling Problem (1972) (79)
Integer realizations of disk and segment graphs (2011) (79)
Total colouring regular bipartite graphs is NP-hard (1994) (74)
List Colouring Squares of Planar Graphs (2007) (68)
Rado's theorem for polymatroids (1975) (66)
Building Heaps Fast (1989) (65)
Graph Imperfection (2001) (59)
Clutter percolation and random graphs (1980) (59)
General percolation and random graphs (1981) (59)
On linear programs with random costs (1986) (58)
Concentration for Independent Permutations (2002) (58)
Random Minimum Length Spanning Trees in Regular Graphs (1998) (56)
Determining the Chromatic Number of a Graph (1979) (54)
Counting Phylogenetic Networks (2015) (52)
Pattern Minimisation in Cutting Stock Problems (1999) (50)
Minimal Positions in a Branching Random Walk (1995) (50)
On the divisibility of graphs (2002) (49)
Large Deviations for Quicksort (1996) (49)
The Complexity of Harmonious Colouring for Trees (1995) (48)
On random minimum length spanning trees (1989) (47)
Random channel assignment in the plane (2003) (47)
Random graphs on surfaces (2008) (46)
Random cubic planar graphs (2007) (44)
On the Number of Edges in Random Planar Graphs (2004) (44)
Random Graphs from Planar and Other Addable Classes (2006) (43)
On the span in channel assignment problems: bounds, computing and counting (2003) (43)
Random Graphs from a Minor-Closed Class (2009) (42)
Star arboricity (1992) (37)
On the power of two choices: Balls and bins in continuous time (2005) (37)
Discrete Mathematics and Radio Channel Assignment (2003) (37)
Volumes Spanned by Random Points in the Hypercube (1992) (36)
On Total Colorings of Graphs (1993) (36)
On the Maximum Degree of a Random Planar Graph (2008) (36)
New upper bounds on harmonious colorings (1994) (35)
An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms (1991) (34)
Random planar graphs with n nodes and a fixed number of edges (2005) (34)
Hypergraph colouring and the Lovász Local Lemma (1997) (32)
Disjoint Common Transversals and Exchange Structures (1976) (31)
On the chromatic number of random geometric graphs (2011) (31)
Asymptotic distributions and chaos for the supermarket model (2007) (29)
Channel assignment on graphs of bounded treewidth (2003) (28)
Graph Imperfection II (2001) (28)
Colouring proximity graphs in the plane (1999) (28)
Concentration for self‐bounding functions and an inequality of Talagrand (2006) (28)
On the bandwidth of triangulated triangles (1995) (27)
The t-Improper Chromatic Number of Random Graphs (2007) (26)
Centering Sequences with Bounded Differences (1997) (24)
Bisecting sparse random graphs (2001) (23)
A Random Recolouring Method for Graphs and Hypergraphs (1993) (23)
Combinatorics, complexity, and chance : a tribute to Dominic Welsh (2007) (22)
On the Chromatic Number of Random Graphs (1990) (22)
Acyclic colouring of graphs (2006) (21)
RANDOM PLANAR GRAPHS WITH GIVEN AVERAGE DEGREE (2007) (20)
Edge-disjoint cycles in regular directed graphs (1996) (19)
Modularity of Erdős‐Rényi random graphs (2018) (19)
Concentration for locally acting permutations (2003) (19)
Sharing jugs of wine (1994) (18)
Average Case Analysis of Heap Building by Repeated Insertion (1991) (18)
Connectivity for Bridge-Addable Monotone Graph Classes (2011) (18)
Upper bounds for harmonious colorings (1991) (18)
Integral decomposition in polyhedra (1983) (17)
Connectivity for Random Graphs from a Weighted Bridge-Addable Class (2012) (17)
Achromatic numbers of random graphs (1982) (17)
Modularity of regular and treelike graphs (2016) (17)
General first-passage percolation (1983) (16)
Linear Arboricity of Random Regular Graphs (1990) (16)
The t-Stability Number of a Random Graph (2008) (16)
Induced Circuits in Planar Graphs (1994) (15)
Extremal Distances for Subtree Transfer Operations in Binary Trees (2015) (15)
Recognition of Unipolar and Generalised Split Graphs (2015) (14)
On a Correlation Inequality of Farr (1992) (14)
Strong concentration for Quicksort (1992) (14)
Probabilistic analysis of tree search (1990) (14)
On-line routing of random calls in networks (2003) (13)
Probabilistic analysis of combinatorial algorithms: an annotated bibliography (1984) (13)
Modularity in random regular graphs and lattices (2013) (12)
On finding a minimum spanning tree in a network with random weights (1997) (12)
Uniform multicommodity flow through the complete graph with random edge-capacities (2009) (12)
Random Graphs from a Weighted Minor-Closed Class (2012) (12)
Random Graphs with Few Disjoint Cycles (2010) (12)
Blocking, antiblocking, and pairs of matroids and polymatroids (1978) (12)
The number of disk graphs (2014) (11)
List colouring squares of planar graphs (extended abstract) (2007) (11)
Random graphs from a block-stable class (2014) (11)
Edge-colouring random graphs (1988) (10)
EXTENSIONS OF MENGER'S THEOREM (1975) (10)
Hamilton Cycles, Minimum Degree, and Bipartite Holes (2016) (10)
An exchange theorem for independence structures (1975) (10)
Concentration for self-bounding functions and an inequality of Talagrand (2006) (10)
The component structure of dense random subgraphs of the hypercube (2018) (9)
Frequency-distance constraints with large distances (2000) (9)
Random Volumes in the n-Cube (1990) (9)
Random Graphs, Geometry and Asymptotic Structure (2016) (9)
Random unlabelled graphs containing few disjoint cycles (2011) (9)
Non-Interfering Network Flows (1992) (8)
On the improvement per iteration in Karmarkar's algorithm for linear programming (1990) (8)
Greedy Matching on the Line (1990) (8)
For most graphs H, most H‐free graphs have a linear homogeneous set (2014) (8)
Partitioning heuristics for two geometric maximization problems (1984) (8)
On graphs with few disjoint t-star minors (2011) (8)
Probability Modelling and Optimal Location of a Travelling Salesman (1992) (8)
Independence Structures and Submodular Functions (1973) (8)
On Independent Sets in Graphs with Given Minimum Degree (2012) (8)
Acyclic improper colourings of graphs with bounded maximum degree (2010) (7)
Average-Case Lower Bounds for Searching (1988) (7)
An upper bound for total colouring of graphs (1993) (7)
On the greedy algorithm with random costs (1986) (7)
Colouring random geometric graphs (2005) (7)
Upper bounds on the non-3-colourability threshold of random graphs (2002) (6)
Combinatorics, Complexity, and Chance (2007) (6)
Giant Components for Two Expanding Graph Processes (2002) (6)
Colour degree matrices of graphs with at most one cycle (2016) (6)
Clique coloring of binomial random graphs (2016) (6)
Edge-Maximal Graphs on Surfaces (2016) (6)
The Number of Bits Needed to Represent a Unit Disk Graph (2010) (6)
Random graphs containing few disjoint excluded minors (2014) (6)
Largest sparse subgraphs of random graphs (2011) (6)
Path‐Partition Structures of Graphs and Digraphs (1974) (6)
Learning random points from geometric graphs or orderings (2018) (5)
Graph imperfection and channel assignment (2006) (5)
Random Hyperplane Search Trees (2009) (4)
Modularity of tree-like and random regular graphs (2016) (4)
Strict Gammoids and Rank Functions (1972) (4)
Channel Assignment with Large Demands (2001) (4)
Uniform multicommodity flows in the hypercube with random edge‐capacities (2014) (4)
Balanced routing of random calls (2008) (4)
Relatively Bridge-Addable Classes of Graphs (2014) (4)
Connectivity for bridge-alterable graph classes (2013) (3)
A Doubly Cyclic Channel Assignment Problem (1997) (3)
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers (1996) (3)
Non-interfering dipaths in planar digraphs (1991) (3)
Lattice bandwidth of random graphs (1991) (3)
Expected numbers at hitting times (1991) (3)
On the purity of minor-closed classes of graphs (2016) (3)
Random graphs embeddable in order-dependent surfaces (2021) (3)
Pattern Reduction in Paper Cutting (2021) (3)
Random graphs from a block class (2014) (3)
Classes of graphs embeddable in order-dependent surfaces (2021) (3)
On some conditioning results in the probabilistic analysis of algorithms (1985) (3)
On the number of systems of distinct representatives in an independence structure (1976) (3)
Random perfect graphs (2016) (3)
On the chromatic forcing number of a random graph (1983) (2)
Clique Colourings of Geometric Graphs (2017) (2)
Topics in Chromatic Graph Theory: Colouring random graphs (2015) (2)
Lectures on random geometric graphs (2016) (2)
On random minimum lenght spanning trees (1989) (2)
Almost Every Graph can be Covered by Linear Forests (1995) (2)
Connectivity for an unlabelled bridge-addable graph class (2020) (2)
Linear Extensions and Comparable Pairs in Partial Orders (2016) (2)
The Strongly Connected Components of 1-in, 1-out (1992) (2)
Connectivity of Addable Monotone Graph Classes (2007) (2)
RR-1423-07 Acyclic t-improper colourings of graphs with bounded maximum degree (2007) (2)
A random bit-flipping method for seeking agreement (1996) (1)
An application of a reduction method of R. Rado to the study of common transversals (1973) (1)
Uniform random planar graphs with degree constraints (2008) (1)
Quicksort and Large Deviations (2012) (1)
Bridge-Addability, Edge-Expansion and Connectivity (2017) (1)
A Note on a Theorem of R. Rado on Independent Transversals (1973) (1)
Percolation on subsets of the square lattice (1980) (1)
Graph Imperfection with a Co-Site Constraint (2004) (1)
The Compexity of Counting Homeomorphs (1985) (1)
On The Span Of A Random Channel Assignment Problem (2007) (1)
Bi-submodular functions, distributive valuations, and distance functions in lattices (1975) (1)
On the critical densities of minor-closed classes (2017) (1)
Almost every graph can be covered by d ∆ 2 e linear forests (2006) (1)
Pendant appearances and components in random graphs from structured classes (2021) (1)
Branching random walk and searching in trees: final report (2010) (0)
A ug 2 01 7 Modularity of regular and treelike graphs (2017) (0)
2 Hamilton Cycles and Related Problems 2 . 1 Existence (2006) (0)
Random graphs from structured classes (2022) (0)
Improper colourings of graphs (2008) (0)
An upper of graphs bound for total colouring (1993) (0)
Modularity of Erd\H{o}s-R\'enyi random graphs (2018) (0)
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs (2001) (0)
Extremal Distances for Subtree Transfer Operations in Binary Trees (2018) (0)
PR ] 6 N ov 2 01 6 CLIQUE COLOURING OF BINOMIAL RANDOM GRAPHS (2018) (0)
STAR ARBOI ~ ICITY 379 3 Graphs with Large Star Arboricity (1992) (0)
General Percolation and Oriented Matroids (1987) (0)
Combinatorics, Geometry and Probability: A Random Recolouring Method for Graphs and Hypergraphs (1997) (0)
Combinatorial Optimisation Notes to accompany lectures in Combinatorial Optimisation (2007) (0)
International Symposium on Combinatorial Optimization 2012 Program Committee Invited Plenary Speakers Organizing Committee Welcome to Co 2012 (0)
ON THE SPREAD OF SUPERCRITICAL RANDOM GRAPHS (2009) (0)
Counting Phylogenetic Networks (2015) (0)
Modularity and edge sampling (2021) (0)
Channel assignment on infinite sets under frequency-distance constraints (2002) (0)
Linear Extensions and Comparable Pairs in Partial Orders (2017) (0)
Dei-erm Iningthe Stability Number Ofa Graph . . Determining the Stability Number of a Graph (0)
On the Spread of Random Graphs (2009) (0)
Giant Components for Two Expanding (2002) (0)
Counting disk graphs (2011) (0)
On the divisibility ofgraphs (2002) (0)

This paper list is powered by the following services:

Colin J. H. Mcdiarmid's Academic­Influence.com Rankings

Why Is Colin J. H. Mcdiarmid Influential?

Colin J. H. Mcdiarmid's Published Works

Published Works

Colin J. H. Mcdiarmid's AcademicInfluence.com Rankings