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="Reed, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex colouring edge partitions
L. Addario-Berry
,
R.E.L. Aldred
,
K. Dalal
,
B.A. Reed
Journal of Combinatorial Theory Series B
94
(2), 2005, pp. 237-244
A note on vertex orders for stability number
N.V.R. Mahadev
,
B.A. Reed
Journal of Graph Theory
30
(2), 1999, pp. 113-120
Branching processes and their applications in the analysis of tree structures and tree algorithms
Luc Devroye
Algorithms and Combinatorics
16
, 1998, pp. 249-314
Probabilistic analysis of algorithms
Alan M. Frieze
,
Bruce Reed
Algorithms and Combinatorics
16
, 1998, pp. 36-92
Probabilistic Methods for Algorithmic Discrete Mathematics
Mark Jerrum
Algorithms and Combinatorics
16
, 1998, pp. 116-165
Concentration
Colin McDiarmid
Algorithms and Combinatorics
16
, 1998, pp. 195-248
The probabilistic method
Michael Molloy
Algorithms and Combinatorics
16
, 1998, pp. 1-35
An overview of randomized algorithms
Rajeev Motwani
,
Prabhakar Raghavan
Algorithms and Combinatorics
16
, 1998, pp. 93-115
\omega
,
\Delta
, and
\chi
B. Reed
Journal of Graph Theory
27
(4), 1998, pp. 177-212
Percolation and the random cluster model: Combinatorial and algorithmic problems
Dominic Welsh
Algorithms and Combinatorics
16
, 1998, pp. 166-194
\beta
-perfect graphs
S.E. Markossian
,
G.S. Gasparian
,
B.A. Reed
Journal of Combinatorial Theory Series B
67
(1), 1996, pp. 1-11
The Gallai-Younger conjecture for planar graphs
B.A. Reed
,
F.B. Shepherd
Combinatorica
16
(4), 1996, pp. 555-566
Right angle free subsets in the plane
B. Gamble
,
W. Pulleyblank
,
B. Reed
,
B. Shepherd
Graphs and Combinatorics
11
, 1995, pp. 121-129
Induced circuits in planar graphs
C. McDiarmid
,
B. Reed
,
A. Schrijver
,
B. Shepherd
Journal of Combinatorial Theory Series B
60
(2), 1994, pp. 169-176
Complete multi-partite cutsets in minimal imperfect graphs
G. Cornuéjols
,
B. Reed
Journal of Combinatorial Theory Series B
59
(2), 1993, pp. 191-198
Fractionally colouring total graphs
K. Kilakos
,
B. Reed
Combinatorica
13
(4), 1993, pp. 435-440
Mick gets some (the odds are on his side)
V. Chvátal
,
B. Reed
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 620-627
Non-interfering network flows
C. McDiarmid
,
B. Reed
,
A. Schrijver
,
B. Shepherd
Lecture Notes in Computer Science
621
, 1992, pp. 245-257
Some classes of perfectly orderable graphs
C.T. Hoàng
,
B.A. Reed
Journal of Graph Theory
13
(4), 1989, pp. 445-463
Building heaps fast
C.J.H. McDiarmid
,
B.A. Reed
Journal of Algorithms
10
, 1989, pp. 352-365
Edge-colouring random graphs
A.M. Frieze
,
B. Jackson
,
C.J.H. McDiarmid
,
B. Reed
Journal of Combinatorial Theory Series B
45
, 1988, pp. 135-149
A semi-strong perfect graph theorem
B. Reed
Journal of Combinatorial Theory Series B
43
(2), 1987, October, pp. 223-240