Colin McDiarmid

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 28

Top Venues

Random Struct. Algorithms

CoRR

Eur. J. Comb.

Comb. Probab. Comput.

Publications

Colin McDiarmid, Sophia Saller
Random graphs embeddable in order-dependent surfaces. Random Struct. Algorithms 64 (4) (2024)
Colin McDiarmid
Pendant appearances and components in random graphs from structured classes. Eur. J. Comb. 120 (2024)
Baptiste Louf, Colin McDiarmid, Fiona Skerman
Modularity and Graph Expansion. ITCS (2024)
Colin McDiarmid, Fiona Skerman
Modularity of very dense graphs. CoRR (2023)
Colin McDiarmid, Alex Scott, Paul Withers
The component structure of dense random subgraphs of the hypercube. Random Struct. Algorithms 59 (1) (2021)
Colin McDiarmid, Fiona Skerman
Modularity and edge sampling. CoRR (2021)
Colin McDiarmid, Fiona Skerman
Modularity of Erdős-Rényi random graphs. Random Struct. Algorithms 57 (1) (2020)
Josep Díaz, Colin McDiarmid, Dieter Mitsche
Learning random points from geometric graphs or orderings. Random Struct. Algorithms 57 (2) (2020)
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
Clique coloring of binomial random graphs. Random Struct. Algorithms 54 (4) (2019)
Colin McDiarmid, Michal Przykucki
On the critical densities of minor-closed classes. Eur. J. Comb. 75 (2019)
Colin McDiarmid, Michal Przykucki
On the purity of minor-closed classes of graphs. J. Comb. Theory, Ser. B 135 (2019)
Colin McDiarmid, Nikola Yolov
Random perfect graphs. Random Struct. Algorithms 54 (1) (2019)
Josep Díaz, Colin McDiarmid, Dieter Mitsche
Learning random points from geometric graphs or orderings. CoRR (2018)
Colin McDiarmid, Fiona Skerman
Modularity of regular and treelike graphs. J. Complex Networks 6 (4) (2018)
Colin McDiarmid, David B. Penman, Vasileios Iliopoulos
Linear Extensions and Comparable Pairs in Partial Orders. Order 35 (3) (2018)
Colin McDiarmid, Fiona Skerman
Modularity of Erdős-Rényi random graphs. CoRR (2018)
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
Clique Colourings of Geometric Graphs. Electron. J. Comb. 25 (4) (2018)
Colin McDiarmid, Fiona Skerman
Modularity of Erdös-Rényi Random Graphs. AofA (2018)
Colin McDiarmid, Nikola Yolov
Hamilton Cycles, Minimum Degree, and Bipartite Holes. J. Graph Theory 86 (3) (2017)
Colin McDiarmid, Alex Scott, Paul Withers
Uniform multicommodity flows in the hypercube with random edge-capacities. Random Struct. Algorithms 50 (3) (2017)
Colin McDiarmid, Kerstin Weller
Bridge-Addability, Edge-Expansion and Connectivity. Comb. Probab. Comput. 26 (5) (2017)
Colin McDiarmid, Nikola Yolov
Recognition of unipolar and generalised split graphs. CoRR (2016)
Colin McDiarmid
Connectivity for bridge-alterable graph classes. Eur. J. Comb. 56 (2016)
Colin McDiarmid, Fiona Skerman
Modularity of tree-like and random regular graphs. CoRR (2016)
A. Hillebrand, Colin McDiarmid
Colour degree matrices of graphs with at most one cycle. Discret. Appl. Math. 209 (2016)
Colin McDiarmid, Alex Scott
Random graphs from a block-stable class. Eur. J. Comb. 58 (2016)
Colin McDiarmid, Nikola Yolov
Recognition of Unipolar and Generalised Split Graphs. Algorithms 8 (1) (2015)
Ross Atkins, Colin McDiarmid
Extremal Distances for Subtree Transfer Operations in Binary Trees. CoRR (2015)
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
Largest sparse subgraphs of random graphs. Eur. J. Comb. 35 (2014)
Louigi Addario-Berry, Svante Janson, Colin McDiarmid
On the Spread of Random Graphs. Comb. Probab. Comput. 23 (4) (2014)
Colin McDiarmid, Tobias Müller
The number of disk graphs. Eur. J. Comb. 35 (2014)
Colin McDiarmid, Valentas Kurauskas
Random graphs containing few disjoint excluded minors. Random Struct. Algorithms 44 (2) (2014)
Colin McDiarmid, Alex D. Scott, Paul Withers
Uniform multicommodity flow in the hypercube with random edge capacities. CoRR (2014)
Colin McDiarmid, Kerstin Weller
Relatively Bridge-Addable Classes of Graphs. LATIN (2014)
Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
-free graphs have a linear homogeneous set. Random Struct. Algorithms 45 (3) (2014)
Colin McDiarmid
Random Graphs from a Weighted Minor-Closed Class. Electron. J. Comb. 20 (2) (2013)
Colin McDiarmid, Fiona Skerman
Modularity in random regular graphs and lattices. Electron. Notes Discret. Math. 43 (2013)
Hiu-Fai Law, Colin McDiarmid
On Independent Sets in Graphs with Given Minimum Degree. Comb. Probab. Comput. 22 (6) (2013)
Colin McDiarmid, Tobias Müller
Integer realizations of disk and segment graphs. J. Comb. Theory, Ser. B 103 (1) (2013)
Colin McDiarmid
Quicksort and Large Deviations. MEMICS (2012)
Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed
Connectivity for Bridge-Addable Monotone Graph Classes. Comb. Probab. Comput. 21 (6) (2012)
Colin McDiarmid
Connectivity for Random Graphs from a Weighted Bridge-Addable Class. Electron. J. Comb. 19 (4) (2012)
Valentas Kurauskas, Colin McDiarmid
Random Graphs with Few Disjoint Cycles. Comb. Probab. Comput. 20 (5) (2011)
Colin McDiarmid, Tobias Müller
Integer realizations of disk and segment graphs CoRR (2011)
Mihyun Kang, Colin McDiarmid
Random unlabelled graphs containing few disjoint cycles. Random Struct. Algorithms 38 (1-2) (2011)
Colin McDiarmid, Tobias Müller
On the chromatic number of random geometric graphs. Comb. 31 (4) (2011)
Colin McDiarmid
On graphs with few disjoint t-star minors. Eur. J. Comb. 32 (8) (2011)
Colin McDiarmid, Tobias Müller
Counting disk graphs. Electron. Notes Discret. Math. 38 (2011)
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
Largest sparse subgraphs of random graphs. Electron. Notes Discret. Math. 38 (2011)
Ross J. Kang, Colin McDiarmid
-Improper Chromatic Number of Random Graphs. Comb. Probab. Comput. 19 (1) (2010)
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
The t-Stability Number of a Random Graph. Electron. J. Comb. 17 (1) (2010)
Colin McDiarmid, Tobias Müller
The Number of Bits Needed to Represent a Unit Disk Graph. WG (2010)
Luc Devroye, James King, Colin McDiarmid
Random Hyperplane Search Trees. SIAM J. Comput. 38 (6) (2009)
David J. Aldous, Colin McDiarmid, Alex D. Scott
Uniform multicommodity flow through the complete graph with random edge-capacities. Oper. Res. Lett. 37 (5) (2009)
Colin McDiarmid
Random Graphs from a Minor-Closed Class. Comb. Probab. Comput. 18 (4) (2009)
Colin McDiarmid, Bruce A. Reed
On the Maximum Degree of a Random Planar Graph. Comb. Probab. Comput. 17 (4) (2008)
Colin McDiarmid
Random graphs on surfaces. J. Comb. Theory, Ser. B 98 (4) (2008)
Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid
Random cubic planar graphs. Random Struct. Algorithms 30 (1-2) (2007)
Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed
List Colouring Squares of Planar Graphs. Electron. Notes Discret. Math. 29 (2007)
Colin McDiarmid
On The Span Of A Random Channel Assignment Problem. Comb. 27 (2) (2007)
Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
Vertex-Colouring Edge-Weightings. Comb. 27 (1) (2007)
Colin McDiarmid, Bruce A. Reed
Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29 (4) (2006)
Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl
nodes and a fixed number of edges. SODA (2005)
Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh
Random planar graphs. J. Comb. Theory, Ser. B 93 (2) (2005)
Stefanie Gerke, Colin McDiarmid
On the Number of Edges in Random Planar Graphs. Comb. Probab. Comput. 13 (2) (2004)
Stefanie Gerke, Colin McDiarmid
Graph Imperfection with a Co-Site Constraint. SIAM J. Discret. Math. 17 (3) (2004)
Colin McDiarmid
Random channel assignment in the plane. Random Struct. Algorithms 22 (2) (2003)
Colin McDiarmid, Bruce A. Reed
Channel assignment on graphs of bounded treewidth. Discret. Math. 273 (1-3) (2003)
Nikolaos Fountoulakis, Colin McDiarmid
Upper bounds on the non-3-colourability threshold of random graphs. Discret. Math. Theor. Comput. Sci. 5 (1) (2002)
Colin McDiarmid
Concentration For Independent Permutations. Comb. Probab. Comput. 11 (2) (2002)
Malwina J. Luczak, Colin McDiarmid
Bisecting sparse random graphs. Random Struct. Algorithms 18 (1) (2001)
Stefanie Gerke, Colin McDiarmid
Channel Assignment with Large Demands. Ann. Oper. Res. 107 (1-4) (2001)
Colin McDiarmid, Bruce A. Reed
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electron. Notes Discret. Math. 10 (2001)
Stefanie Gerke, Colin McDiarmid
Graph Imperfection II. J. Comb. Theory, Ser. B 83 (1) (2001)
Stefanie Gerke, Colin McDiarmid
Graph Imperfection. J. Comb. Theory, Ser. B 83 (1) (2001)
Colin McDiarmid, Bruce A. Reed
Channel assignment and weighted coloring. Networks 36 (2) (2000)
Colin McDiarmid
Pattern Minimisation in Cutting Stock Problems. Discret. Appl. Math. 98 (1-2) (1999)
Colin McDiarmid, Bruce A. Reed
Colouring proximity graphs in the plane. Discret. Math. 199 (1-3) (1999)
Andrew Beveridge, Alan M. Frieze, Colin McDiarmid
Random Minimum Length Spanning Trees in Regular Graphs. Comb. 18 (3) (1998)
Alan M. Frieze, Colin McDiarmid
Algorithmic theory of random graphs. Random Struct. Algorithms 10 (1-2) (1997)
Colin McDiarmid, Theodore Johnson, Harold S. Stone
On finding a minimum spanning tree in a network with random weights. Random Struct. Algorithms 10 (1-2) (1997)
Colin McDiarmid
Hypergraph colouring and the Lovász Local Lemma. Discret. Math. (1997)
Colin McDiarmid
A Doubly Cyclic Channel Assignment Problem. Discret. Appl. Math. 80 (2-3) (1997)
Colin McDiarmid
Centering Sequences with Bounded Differences. Comb. Probab. Comput. 6 (1) (1997)
Noga Alon, Colin McDiarmid, Michael Molloy
Edge-disjoint cycles in regular directed graphs. J. Graph Theory 22 (3) (1996)
Colin McDiarmid, Angelika Steger
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers. J. Comb. Theory, Ser. A 74 (1) (1996)
Colin McDiarmid, Ryan Hayward
Large Deviations for Quicksort. J. Algorithms 21 (3) (1996)
Colin McDiarmid
A random bit-flipping method for seeking agreement. Random Struct. Algorithms 8 (2) (1996)
Colin McDiarmid, Bruce A. Reed
Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Comb. Probab. Comput. 4 (1995)
Keith Edwards, Colin McDiarmid
The Complexity of Harmonious Colouring for Trees. Discret. Appl. Math. 57 (2-3) (1995)
Robert Hochberg, Colin McDiarmid, Michael E. Saks
On the bandwidth of triangulated triangles. Discret. Math. 138 (1-3) (1995)
Keith Edwards, Colin McDiarmid
New upper bounds on harmonious colorings. J. Graph Theory 18 (3) (1994)
Colin McDiarmid
A Random Recolouring Method for Graphs and Hypergrams. Comb. Probab. Comput. 2 (1993)
Colin McDiarmid
On a Correlation Inequality of Farr. Comb. Probab. Comput. 1 (1992)
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
Volumes Spanned by Random Points in the Hypercube. Random Struct. Algorithms 3 (1) (1992)
Colin McDiarmid, Ryan Hayward
Strong Concentration for Quicksort. SODA (1992)
Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
Non-Interfering Network Flows. SWAT (1992)
William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid
On integer points in polyhedra. Comb. 12 (1) (1992)
Noga Alon, Colin McDiarmid, Bruce A. Reed
Star arboricity. Comb. 12 (4) (1992)
Bruce A. Reed, Colin McDiarmid
The Strongly Connected Components of 1-in, 1-out. Comb. Probab. Comput. 1 (1992)

Colin McDiarmid.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Colin McDiarmid