Colin McDiarmid

124 papers A* 2A 1B 2C 1Journal 115Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Note on edge expansion and modularity in preferential attachment graphs.
CoRR
Colin McDiarmid, Katarzyna Rybarczyk, Fiona Skerman, Malgorzata Sulkowska
2025 J jnl
Modularity and random graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2024 A conf
Modularity and Graph Expansion.
ITCS
Baptiste Louf, Colin McDiarmid, Fiona Skerman
2024 J jnl
Pendant appearances and components in random graphs from structured classes.
Eur. J. Comb.
Colin McDiarmid
2024 J jnl
Random graphs embeddable in order-dependent surfaces.
Random Struct. Algorithms
Colin McDiarmid, Sophia Saller
2023 J jnl
Classes of graphs embeddable in order-dependent surfaces.
Comb. Theory
Colin McDiarmid, Sophia Saller
2023 J jnl
Modularity of very dense graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2021 J jnl
Modularity and edge sampling.
CoRR
Colin McDiarmid, Fiona Skerman
2021 J jnl
The component structure of dense random subgraphs of the hypercube.
Random Struct. Algorithms
Colin McDiarmid, Alex Scott, Paul Withers
2020 J jnl
Learning random points from geometric graphs or orderings.
Random Struct. Algorithms
Josep Díaz, Colin McDiarmid, Dieter Mitsche
2020 J jnl
Modularity of Erdős-Rényi random graphs.
Random Struct. Algorithms
Colin McDiarmid, Fiona Skerman
2019 J jnl
Clique coloring of binomial random graphs.
Random Struct. Algorithms
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
2019 J jnl
On the critical densities of minor-closed classes.
Eur. J. Comb.
Colin McDiarmid, Michal Przykucki
2019 J jnl
On the purity of minor-closed classes of graphs.
J. Comb. Theory B
Colin McDiarmid, Michal Przykucki
2019 J jnl
Random perfect graphs.
Random Struct. Algorithms
Colin McDiarmid, Nikola Yolov
2018 J jnl
Clique Colourings of Geometric Graphs.
Electron. J. Comb.
Colin McDiarmid, Dieter Mitsche, Pawel Pralat
2018 J jnl
Learning random points from geometric graphs or orderings.
CoRR
Josep Díaz, Colin McDiarmid, Dieter Mitsche
2018 J jnl
Linear Extensions and Comparable Pairs in Partial Orders.
Order
Colin McDiarmid, David B. Penman, Vasileios Iliopoulos
2018 C conf
Modularity of Erdös-Rényi Random Graphs.
AofA
Colin McDiarmid, Fiona Skerman
2018 J jnl
Modularity of Erdős-Rényi random graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2018 J jnl
Modularity of regular and treelike graphs.
J. Complex Networks
Colin McDiarmid, Fiona Skerman
2017 J jnl
Bridge-Addability, Edge-Expansion and Connectivity.
Comb. Probab. Comput.
Colin McDiarmid, Kerstin Weller
2017 J jnl
Hamilton Cycles, Minimum Degree, and Bipartite Holes.
J. Graph Theory
Colin McDiarmid, Nikola Yolov
2017 J jnl
Uniform multicommodity flows in the hypercube with random edge-capacities.
Random Struct. Algorithms
Colin McDiarmid, Alex Scott, Paul Withers
2016 J jnl
Colour degree matrices of graphs with at most one cycle.
Discret. Appl. Math.
A. Hillebrand, Colin McDiarmid
2016 J jnl
Connectivity for bridge-alterable graph classes.
Eur. J. Comb.
Colin McDiarmid
2016 J jnl
Modularity of tree-like and random regular graphs.
CoRR
Colin McDiarmid, Fiona Skerman
2016 J jnl
Random graphs from a block-stable class.
Eur. J. Comb.
Colin McDiarmid, Alex Scott
2016 J jnl
Recognition of unipolar and generalised split graphs.
CoRR
Colin McDiarmid, Nikola Yolov
2015 J jnl
Extremal Distances for Subtree Transfer Operations in Binary Trees.
CoRR
Ross Atkins, Colin McDiarmid
2015 J jnl
Recognition of Unipolar and Generalised Split Graphs.
Algorithms
Colin McDiarmid, Nikola Yolov
2014 J jnl
For most graphs
Random Struct. Algorithms
Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott
2014 J jnl
Largest sparse subgraphs of random graphs.
Eur. J. Comb.
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2014 J jnl
On the Spread of Random Graphs.
Comb. Probab. Comput.
Louigi Addario-Berry, Svante Janson, Colin McDiarmid
2014 J jnl
Random graphs containing few disjoint excluded minors.
Random Struct. Algorithms
Colin McDiarmid, Valentas Kurauskas
2014 B conf
Relatively Bridge-Addable Classes of Graphs.
LATIN
Colin McDiarmid, Kerstin Weller
2014 J jnl
The number of disk graphs.
Eur. J. Comb.
Colin McDiarmid, Tobias Müller
2014 J jnl
Uniform multicommodity flow in the hypercube with random edge capacities.
CoRR
Colin McDiarmid, Alex D. Scott, Paul Withers
2013 J jnl
Integer realizations of disk and segment graphs.
J. Comb. Theory B
Colin McDiarmid, Tobias Müller
2013 J jnl
Modularity in random regular graphs and lattices.
Electron. Notes Discret. Math.
Colin McDiarmid, Fiona Skerman
2013 J jnl
On Independent Sets in Graphs with Given Minimum Degree.
Comb. Probab. Comput.
Hiu-Fai Law, Colin McDiarmid
2013 J jnl
Random Graphs from a Weighted Minor-Closed Class.
Electron. J. Comb.
Colin McDiarmid
2012 J jnl
Connectivity for Bridge-Addable Monotone Graph Classes.
Comb. Probab. Comput.
Louigi Addario-Berry, Colin McDiarmid, Bruce A. Reed
2012 J jnl
Connectivity for Random Graphs from a Weighted Bridge-Addable Class.
Electron. J. Comb.
Colin McDiarmid
2012 — conf
Quicksort and Large Deviations.
MEMICS
Colin McDiarmid
2011 J jnl
Counting disk graphs.
Electron. Notes Discret. Math.
Colin McDiarmid, Tobias Müller
2011 J jnl
Integer realizations of disk and segment graphs
CoRR
Colin McDiarmid, Tobias Müller
2011 J jnl
Largest sparse subgraphs of random graphs.
Electron. Notes Discret. Math.
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2011 J jnl
On graphs with few disjoint t-star minors.
Eur. J. Comb.
Colin McDiarmid
2011 J jnl
On the chromatic number of random geometric graphs.
Comb.
Colin McDiarmid, Tobias Müller
2011 J jnl
Random Graphs with Few Disjoint Cycles.
Comb. Probab. Comput.
Valentas Kurauskas, Colin McDiarmid
2011 J jnl
Random unlabelled graphs containing few disjoint cycles.
Random Struct. Algorithms
Mihyun Kang, Colin McDiarmid
2010 J jnl
The
Comb. Probab. Comput.
Ross J. Kang, Colin McDiarmid
2010 B conf
The Number of Bits Needed to Represent a Unit Disk Graph.
WG
Colin McDiarmid, Tobias Müller
2010 J jnl
The t-Stability Number of a Random Graph.
Electron. J. Comb.
Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid
2009 J jnl
Random Graphs from a Minor-Closed Class.
Comb. Probab. Comput.
Colin McDiarmid
2009 J jnl
Random Hyperplane Search Trees.
SIAM J. Comput.
Luc Devroye, James King, Colin McDiarmid
2009 J jnl
Uniform multicommodity flow through the complete graph with random edge-capacities.
Oper. Res. Lett.
David J. Aldous, Colin McDiarmid, Alex D. Scott
2008 J jnl
On the Maximum Degree of a Random Planar Graph.
Comb. Probab. Comput.
Colin McDiarmid, Bruce A. Reed
2008 J jnl
Random graphs on surfaces.
J. Comb. Theory B
Colin McDiarmid
2007 J jnl
List Colouring Squares of Planar Graphs.
Electron. Notes Discret. Math.
Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed
2007 J jnl
On The Span Of A Random Channel Assignment Problem.
Comb.
Colin McDiarmid
2007 J jnl
Random cubic planar graphs.
Random Struct. Algorithms
Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid
2007 J jnl
Vertex-Colouring Edge-Weightings.
Comb.
Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
2006 J jnl
Concentration for self-bounding functions and an inequality of Talagrand.
Random Struct. Algorithms
Colin McDiarmid, Bruce A. Reed
2005 A* conf
Random planar graphs with
SODA
Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl
2005 J jnl
Random planar graphs.
J. Comb. Theory B
Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh
2004 J jnl
Graph Imperfection with a Co-Site Constraint.
SIAM J. Discret. Math.
Stefanie Gerke, Colin McDiarmid
2004 J jnl
On the Number of Edges in Random Planar Graphs.
Comb. Probab. Comput.
Stefanie Gerke, Colin McDiarmid
2003 J jnl
Channel assignment on graphs of bounded treewidth.
Discret. Math.
Colin McDiarmid, Bruce A. Reed
2003 J jnl
Random channel assignment in the plane.
Random Struct. Algorithms
Colin McDiarmid
2002 J jnl
Concentration For Independent Permutations.
Comb. Probab. Comput.
Colin McDiarmid
2002 J jnl
Upper bounds on the non-3-colourability threshold of random graphs.
Discret. Math. Theor. Comput. Sci.
Nikolaos Fountoulakis, Colin McDiarmid
2001 J jnl
Bisecting sparse random graphs.
Random Struct. Algorithms
Malwina J. Luczak, Colin McDiarmid
2001 J jnl
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.
Electron. Notes Discret. Math.
Colin McDiarmid, Bruce A. Reed
2001 J jnl
Channel Assignment with Large Demands.
Ann. Oper. Res.
Stefanie Gerke, Colin McDiarmid
2001 J jnl
Graph Imperfection II.
J. Comb. Theory B
Stefanie Gerke, Colin McDiarmid
2001 J jnl
Graph Imperfection.
J. Comb. Theory B
Stefanie Gerke, Colin McDiarmid
2000 J jnl
Channel assignment and weighted coloring.
Networks
Colin McDiarmid, Bruce A. Reed
1999 J jnl
Colouring proximity graphs in the plane.
Discret. Math.
Colin McDiarmid, Bruce A. Reed
1999 J jnl
Pattern Minimisation in Cutting Stock Problems.
Discret. Appl. Math.
Colin McDiarmid
1998 J jnl
Random Minimum Length Spanning Trees in Regular Graphs.
Comb.
Andrew Beveridge, Alan M. Frieze, Colin McDiarmid
1997 J jnl
A Doubly Cyclic Channel Assignment Problem.
Discret. Appl. Math.
Colin McDiarmid
1997 J jnl
Algorithmic theory of random graphs.
Random Struct. Algorithms
Alan M. Frieze, Colin McDiarmid
1997 J jnl
Centering Sequences with Bounded Differences.
Comb. Probab. Comput.
Colin McDiarmid
1997 J jnl
Hypergraph colouring and the Lovász Local Lemma.
Discret. Math.
Colin McDiarmid
1997 J jnl
On finding a minimum spanning tree in a network with random weights.
Random Struct. Algorithms
Colin McDiarmid, Theodore Johnson, Harold S. Stone
1996 J jnl
A random bit-flipping method for seeking agreement.
Random Struct. Algorithms
Colin McDiarmid
1996 J jnl
Edge-disjoint cycles in regular directed graphs.
J. Graph Theory
Noga Alon, Colin McDiarmid, Michael Molloy
1996 J jnl
Large Deviations for Quicksort.
J. Algorithms
Colin McDiarmid, Ryan Hayward
1996 J jnl
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers.
J. Comb. Theory A
Colin McDiarmid, Angelika Steger
1995 J jnl
Almost Every Graph can be Covered by [fracDelta2] Linear Forests.
Comb. Probab. Comput.
Colin McDiarmid, Bruce A. Reed
1995 J jnl
On the bandwidth of triangulated triangles.
Discret. Math.
Robert Hochberg, Colin McDiarmid, Michael E. Saks
1995 J jnl
The Complexity of Harmonious Colouring for Trees.
Discret. Appl. Math.
Keith Edwards, Colin McDiarmid
1994 J jnl
New upper bounds on harmonious colorings.
J. Graph Theory
Keith Edwards, Colin McDiarmid
1993 J jnl
A Random Recolouring Method for Graphs and Hypergrams.
Comb. Probab. Comput.
Colin McDiarmid
1992 — conf
Non-Interfering Network Flows.
SWAT
Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
1992 J jnl
On a Correlation Inequality of Farr.
Comb. Probab. Comput.
Colin McDiarmid
1992 J jnl
On integer points in polyhedra.
Comb.
William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid
1992 J jnl
Small transversals in hypergraphs.
Comb.
Vasek Chvátal, Colin McDiarmid
1992 J jnl
Star arboricity.
Comb.
Noga Alon, Colin McDiarmid, Bruce A. Reed
1992 A* conf
Strong Concentration for Quicksort.
SODA
Colin McDiarmid, Ryan Hayward
1992 J jnl
The Strongly Connected Components of 1-in, 1-out.
Comb. Probab. Comput.
Bruce A. Reed, Colin McDiarmid
1992 J jnl
Volumes Spanned by Random Points in the Hypercube.
Random Struct. Algorithms
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
1991 J jnl
Acyclic Coloring of Graphs.
Random Struct. Algorithms
Noga Alon, Colin McDiarmid, Bruce A. Reed
1991 J jnl
Average Case Analysis of Heap Building by Repeated Insertion.
J. Algorithms
Ryan Hayward, Colin McDiarmid
1991 J jnl
Expected numbers at hitting times.
J. Graph Theory
Colin McDiarmid
1991 J jnl
Lattice bandwidth of random graphs.
Discret. Appl. Math.
Colin McDiarmid, Zevi Miller
1991 J jnl
Upper bounds for harmonious colorings.
J. Graph Theory
Colin McDiarmid, Luo Xinhua
1990 J jnl
Greedy Matching on the Line.
SIAM J. Comput.
Alan M. Frieze, Colin McDiarmid, Bruce A. Reed
1990 J jnl
Linear Arboricity of Random Regular Graphs.
Random Struct. Algorithms
Colin McDiarmid, Bruce A. Reed
1990 J jnl
On the Chromatic Number of Random Graphs.
Random Struct. Algorithms
Colin McDiarmid
1990 J jnl
On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming.
Math. Program.
Colin McDiarmid
1990 — conf
Random Volumes in the n-Cube.
Polyhedral Combinatorics
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
1989 J jnl
Building Heaps Fast.
J. Algorithms
Colin McDiarmid, Bruce A. Reed
1988 J jnl
Average-Case Lower Bounds for Searching.
SIAM J. Comput.
Colin McDiarmid
1986 J jnl
On the greedy algorithm with random costs.
Math. Program.
Colin McDiarmid
1985 J jnl
On some conditioning results in the probabilistic analysis of algorithms.
Discret. Appl. Math.
Colin McDiarmid
1985 J jnl
The Compexity of Counting Homeomorphs.
Theor. Comput. Sci.
Graham Farr, Colin McDiarmid
1984 J jnl
Colouring random graphs.
Ann. Oper. Res.
Colin McDiarmid
1983 J jnl
Integral decomposition in polyhedra.
Math. Program.
Colin McDiarmid
1983 J jnl
On the chromatic forcing number of a random graph.
Discret. Appl. Math.
Colin McDiarmid
1979 J jnl
Determining the Chromatic Number of a Graph.
SIAM J. Comput.
Colin McDiarmid
1978 J jnl
Blocking, antiblocking, and pairs of matroids and polymatroids.
J. Comb. Theory B
Colin McDiarmid