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
Hilfe
Suche: Journal=Combinatorica AND Volume=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Sumsets containing powers of an integer
Tetsuya Abe
Combinatorica
24
(1), 2004, pp. 1-4
The diameter of a scale-free random graph
Béla Bollobás
,
Oliver Riordan
Combinatorica
24
(1), 2004, pp. 5-34
On a problem of Cameron's on inexhaustible graphs
Anthony Bonato
,
Dejan Delić
Combinatorica
24
(1), 2004, pp. 35-51
On small sumsets in
(Z/2Z)^n
Jean-Marc Deshouillers
,
François Hennecart
,
Alain Plagne
Combinatorica
24
(1), 2004, pp. 53-68
On infinite cycles I
Reinhard Diestel
,
Daniela Kühn
Combinatorica
24
(1), 2004, pp. 69-89
On infinite cycles II
Reinhard Diestel
,
Daniela Kühn
Combinatorica
24
(1), 2004, pp. 91-116
Linear discrepancy of totally unimodular matrices
Benjamin Doerr
Combinatorica
24
(1), 2004, pp. 117-125
Circular chromatic number and Mycielski graphs
Genghua Fan
Combinatorica
24
(1), 2004, pp. 127-135
Quantum mechanical algorithms for the Nonabelian hidden subgroup problem
Michelangelo Grigni
,
Leonard J. Schulman
,
Monica Vazirani
,
Umesh Vazirani
Combinatorica
24
(1), 2004, pp. 137-154
Every graph of sufficiently large average degree contains a
C_4
-free subgraph of large average degree
Daniela Kühn
,
Deryk Osthus
Combinatorica
24
(1), 2004, pp. 155-162
A combinatorial proof of Kneser's conjecture
Jiȓí Matous̑ek
Combinatorica
24
(1), 2004, pp. 163-170
The minimum area of convex lattice
n
-gons
Imre Bárány
,
Norihide Tokushige
Combinatorica
24
(2), 2004, pp. 171-185
On the value of a random minimum weight Steiner tree
Béla Bollobás
,
David Gamarnik
,
Oliver Riordan
,
Benny Sudakov
Combinatorica
24
(2), 2004, pp. 187-207
Parametrized partitions of products of finite sets
C.A. di Prisco
,
J. Llopis
,
S. Todorcevic
Combinatorica
24
(2), 2004, pp. 209-232
Cuts, trees and
l_1
-embeddings of graphs
Anupam Gupta
,
Ilan Newman
,
Yuri Rabinovich
,
Alistair Sinclair
Combinatorica
24
(2), 2004, pp. 233-269
Partition theorems for left and right variable words
Neil Hindman
,
Randall McCutcheon
Combinatorica
24
(2), 2004, pp. 271-286
Induced subdivisions in
K_{s,s}
-free graphs of large average degree
Daniela Kühn
,
Deryk Osthus
Combinatorica
24
(2), 2004, pp. 287-304
Nonexistence of a Kruskal-Katona type theorem for subword orders
Uwe Leck
Combinatorica
24
(2), 2004, pp. 305-312
An explicit construction for a Ramsey problem
Dhruv Mubayi
Combinatorica
24
(2), 2004, pp. 313-324
On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs
Ján Ninc̑ák
,
Peter J. Owens
Combinatorica
24
(2), 2004, pp. 325-329
Decomposing
k
-arc-strong tournaments into strong spanning subdigraphs
Jrgen Bang-Jensen
,
Anders Yeo
Combinatorica
24
(3), 2004, pp. 331-349
Lower bounds for multidimensional zero sums
Christian Elsholtz
Combinatorica
24
(3), 2004, pp. 351-358
Isoperimetric invariants for product Markov chains and graph products
C. Houdré
,
P. Tetali
Combinatorica
24
(3), 2004, pp. 359-388
On graphs with small Ramsey numbers, II
A.V. Kostochka
,
V. Rödl
Combinatorica
24
(3), 2004, pp. 389-401
Triangle factors in sparse pseudo-random graphs
Michael Krivelevich
,
Benni Sudakov
,
Tibor Szabó
Combinatorica
24
(3), 2004, pp. 403-426
Seiten 1
2
>