| |
Colin J. H. McDiarmid
List of publications from the DBLP Bibliography Server - FAQ
| 2009 | ||
|---|---|---|
| 70 | EE | Luc Devroye, James King, Colin McDiarmid: Random Hyperplane Search Trees. SIAM J. Comput. 38(6): 2411-2425 (2009) |
| 2008 | ||
| 69 | EE | Colin McDiarmid, Bruce A. Reed: On the Maximum Degree of a Random Planar Graph. Combinatorics, Probability & Computing 17(4): 591-601 (2008) |
| 68 | EE | Colin McDiarmid: Random graphs on surfaces. J. Comb. Theory, Ser. B 98(4): 778-797 (2008) |
| 2007 | ||
| 67 | EE | Louigi Addario-Berry, Ketan Dalal, Colin McDiarmid, Bruce A. Reed, Andrew Thomason: Vertex-Colouring Edge-Weightings. Combinatorica 27(1): 1-12 (2007) |
| 66 | EE | Colin McDiarmid: On The Span Of A Random Channel Assignment Problem. Combinatorica 27(2): 183-203 (2007) |
| 65 | EE | Ross J. Kang, Colin J. H. McDiarmid: The t-improper chromatic number of random graphs. Electronic Notes in Discrete Mathematics 29: 411-417 (2007) |
| 64 | EE | Frédéric Havet, Jan van den Heuvel, Colin McDiarmid, Bruce A. Reed: List Colouring Squares of Planar Graphs. Electronic Notes in Discrete Mathematics 29: 515-519 (2007) |
| 63 | EE | Manuel Bodirsky, Mihyun Kang, Mike Löffler, Colin McDiarmid: Random cubic planar graphs. Random Struct. Algorithms 30(1-2): 78-94 (2007) |
| 2006 | ||
| 62 | EE | Colin McDiarmid, Bruce A. Reed: Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms 29(4): 549-557 (2006) |
| 2005 | ||
| 61 | EE | Stefanie Gerke, Colin McDiarmid, Angelika Steger, Andreas Weißl: Random planar graphs with n nodes and a fixed number of edges. SODA 2005: 999-1007 |
| 60 | EE | Colin McDiarmid, Angelika Steger, Dominic J. A. Welsh: Random planar graphs. J. Comb. Theory, Ser. B 93(2): 187-205 (2005) |
| 2004 | ||
| 59 | Stefanie Gerke, Colin McDiarmid: On the Number of Edges in Random Planar Graphs. Combinatorics, Probability & Computing 13(2): 165-183 (2004) | |
| 58 | EE | Stefanie Gerke, Colin McDiarmid: Graph Imperfection with a Co-Site Constraint. SIAM J. Discrete Math. 17(3): 403-425 (2004) |
| 2003 | ||
| 57 | EE | Malwina J. Luczak, Colin J. H. McDiarmid: Concentration for locally acting permutations. Discrete Mathematics 265(1-3): 159-171 (2003) |
| 56 | EE | Colin J. H. McDiarmid: On the span in channel assignment problems: bounds, computing and counting. Discrete Mathematics 266(1-3): 387-397 (2003) |
| 55 | EE | Colin McDiarmid, Bruce A. Reed: Channel assignment on graphs of bounded treewidth. Discrete Mathematics 273(1-3): 183-192 (2003) |
| 54 | EE | Colin McDiarmid: Random channel assignment in the plane. Random Struct. Algorithms 22(2): 187-212 (2003) |
| 2002 | ||
| 53 | Colin McDiarmid: Concentration For Independent Permutations. Combinatorics, Probability & Computing 11(2): (2002) | |
| 52 | EE | Chính T. Hoàng, Colin J. H. McDiarmid: On the divisibility of graphs. Discrete Mathematics 242(1-3): 145-156 (2002) |
| 51 | EE | Nikolaos Fountoulakis, Colin McDiarmid: Upper bounds on the non-3-colourability threshold of random graphs. Discrete Mathematics & Theoretical Computer Science 5(1): 205-226 (2002) |
| 2001 | ||
| 50 | EE | Stefanie Gerke, Colin McDiarmid: Channel Assignment with Large Demands. Annals OR 107(1-4): 143-159 (2001) |
| 49 | EE | Colin McDiarmid, Bruce A. Reed: Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs. Electronic Notes in Discrete Mathematics 10: 198-201 (2001) |
| 48 | EE | Stefanie Gerke, Colin McDiarmid: Graph Imperfection. J. Comb. Theory, Ser. B 83(1): 58-78 (2001) |
| 47 | EE | Stefanie Gerke, Colin McDiarmid: Graph Imperfection II. J. Comb. Theory, Ser. B 83(1): 79-101 (2001) |
| 46 | Malwina J. Luczak, Colin McDiarmid: Bisecting sparse random graphs. Random Struct. Algorithms 18(1): 31-38 (2001) | |
| 2000 | ||
| 45 | EE | Colin J. H. McDiarmid: Frequency-distance constraints with large distances. Discrete Mathematics 223(1-3): 227-251 (2000) |
| 44 | EE | Colin McDiarmid, Bruce A. Reed: Channel assignment and weighted coloring. Networks 36(2): 114-117 (2000) |
| 1999 | ||
| 43 | EE | Colin McDiarmid: Pattern Minimisation in Cutting Stock Problems. Discrete Applied Mathematics 98(1-2): 121-130 (1999) |
| 42 | EE | Colin McDiarmid, Bruce A. Reed: Colouring proximity graphs in the plane. Discrete Mathematics 199(1-3): 123-137 (1999) |
| 1998 | ||
| 41 | EE | Andrew Beveridge, Alan M. Frieze, Colin McDiarmid: Random Minimum Length Spanning Trees in Regular Graphs. Combinatorica 18(3): 311-333 (1998) |
| 1997 | ||
| 40 | Colin McDiarmid: Centering Sequences with Bounded Differences. Combinatorics, Probability & Computing 6(1): 79-86 (1997) | |
| 39 | EE | Colin McDiarmid: A Doubly Cyclic Channel Assignment Problem. Discrete Applied Mathematics 80(2-3): 263-268 (1997) |
| 38 | EE | Colin McDiarmid: Hypergraph colouring and the Lovász Local Lemma. Discrete Mathematics 167-168: 481-486 (1997) |
| 37 | 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): 187-204 (1997) | |
| 36 | Alan M. Frieze, Colin McDiarmid: Algorithmic theory of random graphs. Random Struct. Algorithms 10(1-2): 5-42 (1997) | |
| 1996 | ||
| 35 | Colin McDiarmid, Ryan Hayward: Large Deviations for Quicksort. J. Algorithms 21(3): 476-507 (1996) | |
| 34 | EE | Colin McDiarmid, Angelika Steger: Tidier Examples for Lower Bounds on Diagonal Ramsey Numbers. J. Comb. Theory, Ser. A 74(1): 147-152 (1996) |
| 33 | Colin McDiarmid: A random bit-flipping method for seeking agreement. Random Struct. Algorithms 8(2): 121-130 (1996) | |
| 1995 | ||
| 32 | Colin McDiarmid, Bruce A. Reed: Almost Every Graph can be Covered by [fracDelta2] Linear Forests. Combinatorics, Probability & Computing 4: 257-268 (1995) | |
| 31 | EE | Keith Edwards, Colin McDiarmid: The Complexity of Harmonious Colouring for Trees. Discrete Applied Mathematics 57(2-3): 133-144 (1995) |
| 30 | EE | Robert Hochberg, Colin McDiarmid, Michael E. Saks: On the bandwidth of triangulated triangles. Discrete Mathematics 138(1-3): 261-265 (1995) |
| 1994 | ||
| 29 | EE | Colin J. H. McDiarmid, Abdón Sánchez-Arroyo: Total colouring regular bipartite graphs is NP-hard. Discrete Mathematics 124(1-3): 155-162 (1994) |
| 28 | EE | Colin J. H. McDiarmid, Jorge Ramirez Alfonsin: Sharing jugs of wine. Discrete Mathematics 125(1-3): 279-287 (1994) |
| 27 | EE | Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd: Induced Circuits in Planar Graphs. J. Comb. Theory, Ser. B 60(2): 169-176 (1994) |
| 1993 | ||
| 26 | Colin McDiarmid: A Random Recolouring Method for Graphs and Hypergrams. Combinatorics, Probability & Computing 2: 363-365 (1993) | |
| 25 | EE | Colin J. H. McDiarmid, Abdón Sánchez-Arroyo: An upper bound for total colouring of graphs. Discrete Mathematics 111(1-3): 389-392 (1993) |
| 24 | EE | Colin J. H. McDiarmid, Bruce A. Reed: On Total Colorings of Graphs. J. Comb. Theory, Ser. B 57(1): 122-130 (1993) |
| 1992 | ||
| 23 | EE | Colin McDiarmid, Ryan Hayward: Strong Concentration for Quicksort. SODA 1992: 414-421 |
| 22 | Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, B. Shepherd: Non-Interfering Network Flows. SWAT 1992: 245-257 | |
| 21 | Vasek Chvátal, Colin McDiarmid: Small transversals in hypergraphs. Combinatorica 12(1): 19-26 (1992) | |
| 20 | William J. Cook, Mark Hartmann, Ravi Kannan, Colin McDiarmid: On integer points in polyhedra. Combinatorica 12(1): 27-37 (1992) | |
| 19 | Noga Alon, Colin McDiarmid, Bruce A. Reed: Star arboricity. Combinatorica 12(4): 375-380 (1992) | |
| 18 | Colin McDiarmid: On a Correlation Inequality of Farr. Combinatorics, Probability & Computing 1: 157-160 (1992) | |
| 17 | Bruce A. Reed, Colin McDiarmid: The Strongly Connected Components of 1-in, 1-out. Combinatorics, Probability & Computing 1: 265-274 (1992) | |
| 16 | Martin E. Dyer, Zoltán Füredi, Colin McDiarmid: Volumes Spanned by Random Points in the Hypercube. Random Struct. Algorithms 3(1): 91-106 (1992) | |
| 1991 | ||
| 15 | Colin J. H. McDiarmid, Gregory M. Provan: An Expected-Cost Analysis of Backtracking and Non-Backtracking Algorithms. IJCAI 1991: 172-177 | |
| 14 | EE | Colin McDiarmid, Zevi Miller: Lattice bandwidth of random graphs. Discrete Applied Mathematics 30(2-3): 221-227 (1991) |
| 13 | Ryan Hayward, Colin McDiarmid: Average Case Analysis of Heap Building by Repeated Insertion. J. Algorithms 12(1): 126-153 (1991) | |
| 12 | Noga Alon, Colin McDiarmid, Bruce A. Reed: Acyclic Coloring of Graphs. Random Struct. Algorithms 2(3): 277-288 (1991) | |
| 1990 | ||
| 11 | Colin McDiarmid: On the Improvement per Iteration in Karmarkar's Algorithm for Linear Programming. Math. Program. 46: 299-320 (1990) | |
| 10 | Colin McDiarmid: On the Chromatic Number of Random Graphs. Random Struct. Algorithms 1(4): 435-442 (1990) | |
| 9 | Colin McDiarmid, Bruce A. Reed: Linear Arboricity of Random Regular Graphs. Random Struct. Algorithms 1(4): 443-447 (1990) | |
| 8 | Alan M. Frieze, Colin McDiarmid, Bruce A. Reed: Greedy Matching on the Line. SIAM J. Comput. 19(4): 666-672 (1990) | |
| 1989 | ||
| 7 | Alan M. Frieze, Colin J. H. McDiarmid: On random minimum lenght spanning trees. Combinatorica 9(4): 363-374 (1989) | |
| 6 | Colin McDiarmid, Bruce A. Reed: Building Heaps Fast. J. Algorithms 10(3): 352-365 (1989) | |
| 1988 | ||
| 5 | EE | Alan M. Frieze, B. Jackson, Colin J. H. McDiarmid, Bruce A. Reed: Edge-colouring random graphs. J. Comb. Theory, Ser. B 45(2): 135-149 (1988) |
| 4 | Colin McDiarmid: Average-Case Lower Bounds for Searching. SIAM J. Comput. 17(5): 1044-1060 (1988) | |
| 1985 | ||
| 3 | Graham Farr, Colin McDiarmid: The Compexity of Counting Homeomorphs. Theor. Comput. Sci. 36: 345-348 (1985) | |
| 1979 | ||
| 2 | Colin McDiarmid: Determining the Chromatic Number of a Graph. SIAM J. Comput. 8(1): 1-14 (1979) | |
| 1978 | ||
| 1 | EE | Colin McDiarmid: Blocking, antiblocking, and pairs of matroids and polymatroids. J. Comb. Theory, Ser. B 25(3): 313-325 (1978) |