The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of Colin McDiarmid Colin J. H. McDiarmid ( http://dblp.L3S.de/Authors/Colin_McDiarmid )

Publication years (Num. hits)
1978-1991 (15) 1992-1995 (17) 1996-2001 (18) 2002-2007 (17) 2008-2011 (15)
Publication types (Num. hits)
article(77) inproceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

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