Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Mcdiarmid, Colin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Integer realizations of disk and segment graphs
Colin McDiarmid
,
Tobias Müller
Journal of Combinatorial Theory Series B
103
(1), 2013, pp. 114-143
On the chromatic number of random geometric graphs
Colin Mcdiarmid
,
Tobias Müller
Combinatorica
31
(4), 2011, pp. 423-488
The number of bits needed to represent a unit disk graph
Colin McDiarmid
,
Tobias Müller
Lecture Notes in Computer Science
6410
, 2010, pp. 315-323
Random hyperplane search trees
Luc Devroye
,
James King
,
Colin McDiarmid
SIAM Journal on Computing
38
(6), 2009, pp. 2411-2425
Random graphs on surfaces
Colin McDiarmid
Journal of Combinatorial Theory Series B
98
(4), 2008, pp. 778-797
Vertex-colouring edge-weightings
Louigi Addario-Berry
,
Ketan Dalal
,
Colin McDiarmid
,
Bruce A. Reed
,
Andrew Thomason
Combinatorica
27
(1), 2007, pp. 1-12
On the span of a random channel assignment problem
Colin McDiarmid
Combinatorica
27
(2), 2007, pp. 183-203
Random planar graphs
Colin McDiarmid
,
Angelika Steger
,
Dominic J.A. Welsh
Journal of Combinatorial Theory Series B
93
(2), 2005, pp. 187-205
Graph imperfection with a co-site constraint
Stefanie Gerke
,
Colin McDiarmid
SIAM Journal on Discrete Mathematics
17
(3), 2004, pp. 403-425
Discrete mathematics and radio channel assignment
Colin McDiarmid
CMS Books in Mathematics
11
, 2003, pp. 27-63
Graph imperfection
Stefanie Gerke
,
Colin McDiarmid
Journal of Combinatorial Theory Series B
83
(1), 2001, pp. 58-78
Channel assignment and weighted coloring
Colin McDiarmid
,
Bruce Reed
Networks
36
(2), 2000, pp. 114-117
Pattern minimisation in cutting stock problems
Colin McDiarmid
Discrete Applied Mathematics
98
(1-2), 1999, pp. 121-130
Random minimum length spanning trees in regular graphs
Andrew Beveridge
,
Alan Frieze
,
Colin McDiarmid
Combinatorica
18
(3), 1998, pp. 311-333
Concentration
Colin McDiarmid
Algorithms and Combinatorics
16
, 1998, pp. 195-248
A doubly cyclic channel assignment problem
Colin McDiarmid
Discrete Applied Mathematics
80
(2-3), 1997, pp. 263-268
Edge-disjoint cycles in regular directed graphs
Noga Alon
,
Colin McDiarmid
,
Michael Molloy
Journal of Graph Theory
22
(3), 1996, pp. 231-237
Tidier examples for lower bounds on diagonal Ramsey numbers
Colin McDiarmid
,
Angelika Steger
Journal of Combinatorial Theory Series A
74
(1), 1996, pp. 147-152
The complexity of harmonious colouring for trees
Keith Edwards
,
Colin McDiarmid
Discrete Applied Mathematics
57
, 1995, pp. 133-144
New upper bounds on harmonious colorings
Keith Edwards
,
Colin McDiarmid
Journal of Graph Theory
18
(3), 1994, pp. 257-267
On total colourings of graphs
Colin McDiarmid
,
Bruce Reed
Journal of Combinatorial Theory Series B
57
(1), 1993, pp. 122-130
Star arboricity
Noga Alon
,
Colin McDiarmid
,
Bruce Reed
Combinatorica
12
(4), 1992, pp. 375-380
Strong concentration for quicksort
Colin McDiarmid
,
Ryan Hayward
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 414-421
On a correlation inequality of Farr
Colin McDiarmid
Combinatorics, Probability and Computing
1
, 1992, pp. 157-160
Average case analysis of heap building by repeated insertion
Ryan Hayward
,
Colin McDiarmid
Journal of Algorithms
12
, 1991, pp. 126-153
Seiten 1
2
>