Colin J. H. McDiarmid

16 papers A* 1Journal 14
YearRankTypeTitle / Venue / Authors
2016 — book
Random Graphs, Geometry and Asymptotic Structure.
Michael Krivelevich, Konstantinos Panagiotou, Mathew D. Penrose, Colin J. H. McDiarmid
2010 J jnl
Acyclic improper colourings of graphs with bounded maximum degree.
Discret. Math.
Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou
2007 J jnl
The t-improper chromatic number of random graphs.
Electron. Notes Discret. Math.
Ross J. Kang, Colin J. H. McDiarmid
2003 J jnl
Concentration for locally acting permutations.
Discret. Math.
Malwina J. Luczak, Colin J. H. McDiarmid
2003 J jnl
On the span in channel assignment problems: bounds, computing and counting.
Discret. Math.
Colin J. H. McDiarmid
2002 J jnl
On the divisibility of graphs.
Discret. Math.
Chính T. Hoàng, Colin J. H. McDiarmid
2000 J jnl
Frequency-distance constraints with large distances.
Discret. Math.
Colin J. H. McDiarmid
1994 J jnl
Induced Circuits in Planar Graphs.
J. Comb. Theory B
Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
1994 J jnl
Sharing jugs of wine.
Discret. Math.
Colin J. H. McDiarmid, Jorge L. Ramírez Alfonsín
1994 J jnl
Total colouring regular bipartite graphs is NP-hard.
Discret. Math.
Colin J. H. McDiarmid, Abdón Sánchez-Arroyo
1993 J jnl
An upper bound for total colouring of graphs.
Discret. Math.
Colin J. H. McDiarmid, Abdón Sánchez-Arroyo
1993 J jnl
On Total Colorings of Graphs.
J. Comb. Theory B
Colin J. H. McDiarmid, Bruce A. Reed
1991 A* conf
An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms.
IJCAI
Colin J. H. McDiarmid, Gregory M. Provan
1989 J jnl
On random minimum lenght spanning trees.
Comb.
Alan M. Frieze, Colin J. H. McDiarmid
1988 J jnl
Edge-colouring random graphs.
J. Comb. Theory B
Alan M. Frieze, Bill Jackson, Colin J. H. McDiarmid, Bruce A. Reed
1986 J jnl
On linear programs with random costs.
Math. Program.
Martin E. Dyer, Alan M. Frieze, Colin J. H. McDiarmid