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="Bollob{\'{a}}s, B{\'{e}}la"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proving integrality gaps without knowing the linear program
Sanjeev Arora
,
Béla Bollobás
,
László Lovász
Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'2002 (Vancouver, BC, Canada, November 16-19, 2002)
, 2002, pp. 313-322
Measures on monotone properties of graphs
Jòzsef Balogh
,
Béla Bollobás
,
David Weinreich
Discrete Applied Mathematics
116
(1-2), 2002, pp. 17-36
Girth of sparse graphs
Béla Bollobás
,
Endre Szemerédi
Journal of Graph Theory
39
(3), 2002, pp. 194-200
Evaluations of the circuit partition polynomial
Béla Bollobás
Journal of Combinatorial Theory Series B
85
(2), 2002, pp. 261-268
Euler circuits and DNA sequencing by hybridization
Richard Arratia
,
Béla Bollobás
,
Don Coppersmith
,
Gregory B. Sorkin
Discrete Applied Mathematics
104
(1-3), 2000, pp. 63-96
The speed of hereditary properties of graphs
József Balogh
,
Béla Bollobás
,
David Weinreich
Journal of Combinatorial Theory Series B
79
(2), 2000, pp. 131-156
Contraction-deletion invariants for graphs
Béla Bollobás
,
Luke Pebody
,
Oliver Riordan
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 320-345
The structure of hereditary properties and colourings of random graphs
Béla Bollobás
,
Andrew Thomason
Combinatorica
20
(2), 2000, pp. 173-202
Weakly pancyclic graphs
Béla Bollobás
,
Andrew Thomason
Journal of Combinatorial Theory Series B
77
(1), 1999, pp. 121-137
Random walks and electrical resistances in products of graphs
Béla Bollobás
,
Grahm Brightwell
Discrete Applied Mathematics
73
(1), 1997, pp. 69-79
Matchings and paths in the cube
Béla Bollobás
,
Imre Leader
Discrete Applied Mathematics
75
(1), 1997, pp. 1-8
On the girth of Hamiltonian weakly pancyclic graphs
Béla Bollobás
,
Andrew Thomason
Journal of Graph Theory
26
(3), 1997, pp. 165-173
Highly linked graphs
Béla Bollobás
,
Andrew Thomason
Combinatorica
16
(3), 1996, pp. 313-320
The maximal number of induced
r
-partite subgraphs
Béla Bollobás
,
Yoshimi Egawa
,
Andrew Harris
,
Guoping Jin
Graphs and Combinatorics
11
, 1995, pp. 1-19
Extremal graph theory
Béla Bollobás
Handbook of Combinatorics
2
, 1995, pp. 1231-1292
Almost every graph has reconstruction number three
Béla Bollobás
Journal of Graph Theory
14
(1), 1990, pp. 1-4
Rotation numbers for unions of circuits
Béla Bollobás
,
E.J. Cockayne
,
Fang Zu Yao
Journal of Graph Theory
8
(1), 1984, pp. 69-81
On 4-cycles in random bipartite tournaments
Béla Bollobás
,
Ove Frank
,
Michaƚ Karoński
Journal of Graph Theory
7
(2), 1983, pp. 183-194
More rotation numbers for complete bipartite graphs
Béla Bollobás
,
E.J. Cockayne
Journal of Graph Theory
6
(4), 1982, pp. 403-411
Vertices of given degree in a random graph
Béla Bollobás
Journal of Graph Theory
6
(2), 1982, pp. 147-155
Extremal problems in graph theory
Béla Bollobás
Journal of Graph Theory
1
(2), 1977, pp. 117-123
Three-graphs without two triples whose symmetric difference is contained in a third
Béla Bollobás
Discrete Mathematics
8
(1), 1974, pp. 21-24