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=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On uniform
f
-vectors of cutsets in the truncated Boolean lattice
Béla Bajnok
,
Shahriar Shahriari
Combinatorica
20
(1), 2000, pp. 1-14
A theorem of Truemper
Michele Conforti
,
Bert Gerards
,
Ajai Kapoor
Combinatorica
20
(1), 2000, pp. 15-26
Erd\Hos-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
Péter L. Erdŏs
,
Ákos Seress
,
László A. Székely
Combinatorica
20
(1), 2000, pp. 27-45
Approximate homomorphisms II: Group homomorphisms
Ilijas Farah
Combinatorica
20
(1), 2000, pp. 47-60
An algebraic matching algorithm
James F. Geelen
Combinatorica
20
(1), 2000, pp. 61-70
Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
Vince Grolmusz
Combinatorica
20
(1), 2000, pp. 71-85
Adaptive multicolouring
Jeannette Janssen
,
Kyriakos Kilakos
Combinatorica
20
(1), 2000, pp. 87-102
On the signed domination in graphs
Jiȓí Matous̑ek
Combinatorica
20
(1), 2000, pp. 103-108
Bicliques in graphs I: Bounds on their number
Erich Prisner
Combinatorica
20
(1), 2000, pp. 109-117
Decomposing hypergraphs into simple hypertrees
Raphael Yuster
Combinatorica
20
(1), 2000, pp. 119-140
New upper bounds for a cononical Ramsey problem
Tao Jiang
,
Dhruv Mubayi
Combinatorica
20
(1), 2000, pp. 141-146
Spectral characterization of tree-width-two graphs
Andreĭ Kotlov
Combinatorica
20
(1), 2000, pp. 147-152
\lambda_\infty
, vertex isoperimetry and concentration
S. Bobkov
,
C. Houdré
,
P. Tetali
Combinatorica
20
(2), 2000, pp. 153-172
The structure of hereditary properties and colourings of random graphs
Béla Bollobás
,
Andrew Thomason
Combinatorica
20
(2), 2000, pp. 173-202
Tiling Turán theorems
János Komlós
Combinatorica
20
(2), 2000, pp. 203-218
Neighborhoods and covering vertices by cycles
Mekkia Kouider
Combinatorica
20
(2), 2000, pp. 219-226
Graph pairs and their entropies: Modularity problems
János Körner
,
Gábor Simonyi
Combinatorica
20
(2), 2000, pp. 227-240
VC
-dimension of sets of permutations
Ran Raz
Combinatorica
20
(2), 2000, pp. 241-255
On size Ramsey numbers of graphs with bounded degree
Vojtȇch Rödl
,
Endre Szemerédi
Combinatorica
20
(2), 2000, pp. 257-262
Ups and downs of first order sentences on random graphs
Joel Spencer
,
Gábor Tardos
Combinatorica
20
(2), 2000, pp. 263-280
A lower bound for the translative kissing numbers of simplices
István Talata
Combinatorica
20
(2), 2000, pp. 281-293
The Johnson graphs satisfy a distance extension property
Andrew Dabrowski
,
Lawrence S. Moss
Combinatorica
20
(2), 2000, pp. 295-300
Testing monotonicity
Oded Goldreich
,
Shafi Goldwasser
,
Eric Lehman
,
Dana Ron
,
Alex Samorodnitsky
Combinatorica
20
(3), 2000, pp. 301-337
A normal law for matchings
Jeff Kahn
Combinatorica
20
(3), 2000, pp. 339-391
On the hardness of approximating the chromatic number
Sanjeev Khanna
,
Nathan Linial
,
Shmuel Safra
Combinatorica
20
(3), 2000, pp. 393-415
Seiten 1
2
>