Random graphs on surfaces. by McDiarmid, C

On the span in channel assignment problems: bounds, computing and counting by McDiarmid, C

On the span in channel assignment problems: Bounds, computing and counting by McDiarmid, C

Quicksort and Large Deviations. by McDiarmid, C

A doubly cyclic channel assignment problem by McDiarmid, C

Frequency-distance constraints with large distances by McDiarmid, C

Hypergraph colouring and the Lovász Local Lemma by McDiarmid, C

On The Span Of A Random Channel Assignment Problem. by McDiarmid, C

Connectivity for random graphs from a weighted bridge-addable class by McDiarmid, C

Random Graphs from a Minor-Closed Class. by McDiarmid, C

Concentration For Independent Permutations. by McDiarmid, C

On graphs with few disjoint t-star minors. by McDiarmid, C

Connectivity for bridge-alterable graph classes by McDiarmid, C

Random graphs from a weighted minor-closed class by McDiarmid, C

Random channel assignment in the plane. by McDiarmid, C

The number of disk graphs by McDiarmid, C, Müller, T

The Number of Bits Needed to Represent a Unit Disk Graph. by McDiarmid, C, Müller, T

On the Number of Edges in Random Planar Graphs. by Gerke, S, McDiarmid, C

Integer realizations of disk and segment graphs by McDiarmid, C, Muller, T

On the chromatic number of random geometric graphs by McDiarmid, C, Müller, T