| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid |
Largest sparse subgraphs of random graphs.  |
Electronic Notes in Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
On graphs with few disjoint t-star minors.  |
Eur. J. Comb.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihyun Kang, Colin McDiarmid |
Random unlabelled graphs containing few disjoint cycles.  |
Random Struct. Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentas Kurauskas, Colin McDiarmid |
Random Graphs with Few Disjoint Cycles.  |
Combinatorics, Probability & Computing  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Tobias Müller |
On the chromatic number of random geometric graphs.  |
Combinatorica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Tobias Müller |
Integer realizations of disk and segment graphs  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou |
Acyclic improper colourings of graphs with bounded maximum degree.  |
Discrete Mathematics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid |
The t-Stability Number of a Random Graph.  |
Electr. J. Comb.  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ross J. Kang, Colin McDiarmid |
The t-Improper Chromatic Number of Random Graphs.  |
Combinatorics, Probability & Computing  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Tobias Müller |
The Number of Bits Needed to Represent a Unit Disk Graph.  |
WG  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David J. Aldous, Colin McDiarmid, Alex D. Scott |
Uniform multicommodity flow through the complete graph with random edge-capacities.  |
Oper. Res. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Random Graphs from a Minor-Closed Class.  |
Combinatorics, Probability & Computing  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Luc Devroye, James King, Colin McDiarmid |
Random Hyperplane Search Trees.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Random graphs on surfaces.  |
J. Comb. Theory, Ser. B  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
On the Maximum Degree of a Random Planar Graph.  |
Combinatorics, Probability & Computing  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ross J. Kang, Colin J. H. McDiarmid |
The t-improper chromatic number of random graphs.  |
Electronic Notes in Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed |
List Colouring Squares of Planar Graphs.  |
Electronic Notes in Discrete Mathematics  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid |
Random cubic planar graphs.  |
Random Struct. Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason |
Vertex-Colouring Edge-Weightings.  |
Combinatorica  |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15 |
| 1 | Colin McDiarmid |
On The Span Of A Random Channel Assignment Problem.  |
Combinatorica  |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C80, 05C15, 90B15 |
| 1 | Colin McDiarmid, Bruce A. Reed |
Concentration for self-bounding functions and an inequality of Talagrand.  |
Random Struct. Algorithms  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh |
Random planar graphs.  |
J. Comb. Theory, Ser. B  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl |
Random planar graphs with n nodes and a fixed number of edges.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Colin McDiarmid |
On the Number of Edges in Random Planar Graphs.  |
Combinatorics, Probability & Computing  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Colin McDiarmid |
Graph Imperfection with a Co-Site Constraint.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Malwina J. Luczak, Colin J. H. McDiarmid |
Concentration for locally acting permutations.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid |
On the span in channel assignment problems: bounds, computing and counting.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Channel assignment on graphs of bounded treewidth.  |
Discrete Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Random channel assignment in the plane.  |
Random Struct. Algorithms  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Colin J. H. McDiarmid |
On the divisibility of graphs.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolaos Fountoulakis, Colin McDiarmid |
Upper bounds on the non-3-colourability threshold of random graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Colin McDiarmid |
Concentration For Independent Permutations.  |
Combinatorics, Probability & Computing  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Colin McDiarmid |
Graph Imperfection II.  |
J. Comb. Theory, Ser. B  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Colin McDiarmid |
Graph Imperfection.  |
J. Comb. Theory, Ser. B  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs.  |
Electronic Notes in Discrete Mathematics  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Malwina J. Luczak, Colin McDiarmid |
Bisecting sparse random graphs.  |
Random Struct. Algorithms  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefanie Gerke, Colin McDiarmid |
Channel Assignment with Large Demands.  |
Annals OR  |
2001 |
DBLP DOI BibTeX RDF |
graph imperfection, clique-bounds, channel assignment |
| 1 | Colin J. H. McDiarmid |
Frequency-distance constraints with large distances.  |
Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Channel assignment and weighted coloring.  |
Networks  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Colouring proximity graphs in the plane.  |
Discrete Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Pattern Minimisation in Cutting Stock Problems.  |
Discrete Applied Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Beveridge, Alan M. Frieze, Colin McDiarmid |
Random Minimum Length Spanning Trees in Regular Graphs.  |
Combinatorica  |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C80, 60C05 |
| 1 | Colin McDiarmid |
Hypergraph colouring and the Lovász Local Lemma.  |
Discrete Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Theodore Johnson, Harold S. Stone |
On finding a minimum spanning tree in a network with random weights.  |
Random Struct. Algorithms  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Alan M. Frieze, Colin McDiarmid |
Algorithmic theory of random graphs.  |
Random Struct. Algorithms  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Colin McDiarmid |
Centering Sequences with Bounded Differences.  |
Combinatorics, Probability & Computing  |
1997 |
DBLP BibTeX RDF |
|
| 1 | Colin McDiarmid |
A Doubly Cyclic Channel Assignment Problem.  |
Discrete Applied Mathematics  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Angelika Steger |
Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers.  |
J. Comb. Theory, Ser. A  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
A random bit-flipping method for seeking agreement.  |
Random Struct. Algorithms  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Ryan Hayward |
Large Deviations for Quicksort.  |
J. Algorithms  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Hochberg, Colin McDiarmid, Michael E. Saks |
On the bandwidth of triangulated triangles.  |
Discrete Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Almost Every Graph can be Covered by [fracDelta2] Linear Forests.  |
Combinatorics, Probability & Computing  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Keith Edwards, Colin McDiarmid |
The Complexity of Harmonious Colouring for Trees.  |
Discrete Applied Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd |
Induced Circuits in Planar Graphs.  |
J. Comb. Theory, Ser. B  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Abdón Sánchez-Arroyo |
Total colouring regular bipartite graphs is NP-hard.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Jorge L. Ramírez Alfonsín |
Sharing jugs of wine.  |
Discrete Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Bruce A. Reed |
On Total Colorings of Graphs.  |
J. Comb. Theory, Ser. B  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Abdón Sánchez-Arroyo |
An upper bound for total colouring of graphs.  |
Discrete Mathematics  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
A Random Recolouring Method for Graphs and Hypergrams.  |
Combinatorics, Probability & Computing  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin E. Dyer, Zoltán Füredi, Colin McDiarmid |
Volumes Spanned by Random Points in the Hypercube.  |
Random Struct. Algorithms  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
On a Correlation Inequality of Farr.  |
Combinatorics, Probability & Computing  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Colin McDiarmid |
The Strongly Connected Components of 1-in, 1-out.  |
Combinatorics, Probability & Computing  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Colin McDiarmid, Bruce A. Reed |
Star arboricity.  |
Combinatorica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid |
On integer points in polyhedra.  |
Combinatorica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Colin McDiarmid |
Small transversals in hypergraphs.  |
Combinatorica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Ryan Hayward |
Strong Concentration for Quicksort.  |
SODA  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd |
Non-Interfering Network Flows.  |
SWAT  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Gregory M. Provan |
An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms.  |
IJCAI  |
1991 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Colin McDiarmid, Bruce A. Reed |
Acyclic Coloring of Graphs.  |
Random Struct. Algorithms  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Hayward, Colin McDiarmid |
Average Case Analysis of Heap Building by Repeated Insertion.  |
J. Algorithms  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Zevi Miller |
Lattice bandwidth of random graphs.  |
Discrete Applied Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
On the Chromatic Number of Random Graphs.  |
Random Struct. Algorithms  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Linear Arboricity of Random Regular Graphs.  |
Random Struct. Algorithms  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming.  |
Math. Program.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Colin McDiarmid, Bruce A. Reed |
Greedy Matching on the Line.  |
SIAM J. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, Colin J. H. McDiarmid |
On random minimum lenght spanning trees.  |
Combinatorica  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed |
Building Heaps Fast.  |
J. Algorithms  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Alan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed |
Edge-colouring random graphs.  |
J. Comb. Theory, Ser. B  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Average-Case Lower Bounds for Searching.  |
SIAM J. Comput.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Graham Farr, Colin McDiarmid |
The Compexity of Counting Homeomorphs.  |
Theor. Comput. Sci.  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Determining the Chromatic Number of a Graph.  |
SIAM J. Comput.  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid |
Blocking, antiblocking, and pairs of matroids and polymatroids.  |
J. Comb. Theory, Ser. B  |
1978 |
DBLP DOI BibTeX RDF |
|