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="Brightwell, Graham"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ramsey-goodness - And otherwise
Peter Allen
,
Graham Brightwell
,
Jozef Skokan
Combinatorica
33
(2), 2013, pp. 125-160
Diametral pairs of linear extensions
Graham Brightwell
,
Mareike Massow
SIAM Journal on Discrete Mathematics
27
(2), 2013, pp. 634-649
Shadows of ordered graphs
Béla Bollobás
,
Graham Brightwell
,
Robert Morris
Journal of Combinatorial Theory Series A
118
(3), 2011, pp. 729-747
Permutation capacities of families of oriented infinite paths
Graham Brightwell
,
Gérard Cohen
,
Emanuela Fachini
,
Marianne Fairthorne
,
János Körner
,
Gábor Simonyi
,
Ágnes Tóth
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 441-456
Submodular percolation
Graham R. Brightwell
,
Peter Winkler
SIAM Journal on Discrete Mathematics
23
(3), 2009, pp. 1149-1178
Dominating sets in
k
-majority tournaments
Noga Alon
,
Graham Brightwell
,
H.A. Kierstead
,
A.V. Kostochka
,
Peter Winkler
Journal of Combinatorial Theory Series B
96
(3), 2006, pp. 374-387
How many graphs are unions of
k
-cliques?
Béla Bollobás
,
Graham R. Brightwell
Journal of Graph Theory
52
(2), 2006, pp. 87-107
A linear bound on the diameter of the transportation polytope
Graham Brightwell
,
Jan van den Heuvel
,
Leen Stougie
Combinatorica
26
(2), 2006, pp. 133-139
Gibbs measures and dismantlable graphs
Graham R. Brightwell
,
Peter Winkler
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 141-166
Graph homomorphisms and phase transitions
Graham R. Brightwell
,
Peter Winkler
Journal of Combinatorial Theory Series B
77
(2), 1999, pp. 221-262
The structure of random graph orders
Béla Bollobás
,
Graham Brightwell
SIAM Journal on Discrete Mathematics
10
(2), 1997, pp. 318-335
The order dimension of planar maps
Graham R. Brightwell
,
William T. Trotter
SIAM Journal on Discrete Mathematics
10
(4), 1997, pp. 515-528
Graph homomorphisms and phase transitions
Graham R. Brightwell
,
Peter Winkler
Technical Report (97-62), 1997, November
The average number of linear extensions of a partial order
Graham Brightwell
,
Hans Jürgen Prömel
,
Angelika Steger
Journal of Combinatorial Theory Series A
73
(2), 1996, pp. 193-206
On specifying Boolean functions by labelled examples
Martin Anthony
,
Graham Brightwell
,
John Shawe-Taylor
Discrete Applied Mathematics
61
, 1995, pp. 1-25
Cycles through specified vertices
Béla Bollobás
,
Graham Brightwell
Combinatorica
13
(2), 1993, pp. 147-155
Representations of planar graphs
Graham R. Brightwell
,
Edward R. Scheinerman
SIAM Journal on Discrete Mathematics
6
(2), 1993, May, pp. 214-229
The order dimension of convex polytopes
Graham Brightwell
,
William T. Trotter
SIAM Journal on Discrete Mathematics
6
(2), 1993, May, pp. 230-245
Target shooting with programmed random variables
Graham Brightwell
,
Teunis J. Ott
,
Peter Winkler
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 691-698
The 1/3-2/3 conjecture for 5-thin posets
Graham Brightwell
,
Colin Wright
SIAM Journal on Discrete Mathematics
5
(4), 1992, November, pp. 467-474
Counting linear extensions is
\#P
-complete
Graham Brightwell
,
Peter Winkler
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 175-181
Parallel selection with high probability
Béla Bollobás
,
Graham Brightwell
SIAM Journal on Discrete Mathematics
3
(1), 1990, February, pp. 21-31
Extremal cover times for random walks on trees
Graham Brightwell
,
Peter Winkler
Journal of Graph Theory
14
(5), 1990, pp. 547-554
Events correlated with respect to every subposet of a fixed poset
Graham R. Brightwell
Graphs and Combinatorics
6
, 1990, pp. 111-131
Transitive orientations of graph
Béla Bollobás
,
Graham Brightwell
SIAM Journal on Computing
17
, 1988, pp. 1119-1133