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="Balister, Paul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Repeated degrees in random uniform hypergraphs
Paul Balister
,
Béla Bollobás
,
Jenŏ Lehel
,
Michaƚ Morayne
SIAM Journal on Discrete Mathematics
27
(1), 2013, pp. 145-154
Projections, entropy and sumsets
Paul Balister
,
Béla Bollobás
Combinatorica
32
(2), 2012, pp. 125-141
Connectivity of addable graph classes
Paul Balister
,
Béla Bollobás
,
Stefanie Gerke
Journal of Combinatorial Theory Series B
98
(3), 2008, pp. 577-584
Sequences with changing dependencies
Paul Balister
,
Béla Bollobás
,
Stefanie Gerke
SIAM Journal on Discrete Mathematics
22
(3), 2008, pp. 1149-1154
The generalized Randić index of trees
Paul Balister
,
Béla Bollobás
,
Stefanie Gerke
Journal of Graph Theory
56
(4), 2007, pp. 270-286
Mono-multi bipartite Ramsey numbers, designs, and matrices
Paul N. Balister
,
András Gyárfás
,
Jenŏ Lehel
,
Richard H. Schelp
Journal of Combinatorial Theory Series A
113
(1), 2006, pp. 101-112
Graphs with large maximum degree containing no odd cycles of a given length
Paul Balister
,
Béla Bollobás
,
Oliver Riordan
,
Richard H. Schelp
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 366-373