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 YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A pushing-pulling method: New proofs of intersection theorems
Rudolf Ahlswede
,
Levon H. Khachatrian
Combinatorica
19
(1), 1999, pp. 1-15
On the single-source unsplittable flow problem
Yefim Dinitz
,
Naveen Garg
,
Michel X. Goemans
Combinatorica
19
(1), 1999, pp. 17-41
On linear combinatorics III - Few directions and distorted lattices
György Elekes
Combinatorica
19
(1), 1999, pp. 43-53
The Erd\Hos-Ko-Rado theorem for integer sequences
Peter Frankl
,
Norihide Tokushige
Combinatorica
19
(1), 1999, pp. 55-63
Combinatorics of monotone computations
Stasys Jukna
Combinatorica
19
(1), 1999, pp. 65-85
Submodular flow problem with a nonseparable cost function
Kazuo Murota
Combinatorica
19
(1), 1999, pp. 87-109
Uniformly distributed distances - A geometric application of Janson's inequality
János Pach
,
Joel Spencer
Combinatorica
19
(1), 1999, pp. 111-124
Graphs whose circular chromatic number equals the chromatic number
Xuding Zhu
Combinatorica
19
(1), 1999, pp. 139-149
Ear decompositions of matching covered graphs
Marcelo H. Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Combinatorica
19
(2), 1999, pp. 151-174
Quick approximation to matrices and applications
Alan Frieze
,
Ravi Kannan
Combinatorica
19
(2), 1999, pp. 175-220
More-than-nearly-perfect packings and partial designs
David A. Grable
Combinatorica
19
(2), 1999, pp. 221-239
The linear-array conjecture in communication complexity is false
Eyal Kushilevitz
,
Nathan Linial
,
Rafail Ostrovsky
Combinatorica
19
(2), 1999, pp. 241-254
The number of
M
-sequences and
f
-vectors
Svante Linusson
Combinatorica
19
(2), 1999, pp. 255-266
Mangoes and blueberries
Bruce Reed
Combinatorica
19
(2), 1999, pp. 267-296
On the membership problem for the elementary closure of a polyhedron
Friedrich Eisenbrand
Combinatorica
19
(2), 1999, pp. 297-300
Superpolynomial lower bounds for monotone span programs
László Babai
,
Anna Gál
,
Avi Wigderson
Combinatorica
19
(3), 1999, pp. 301-319
Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
Sergei Evdokimov
,
Ilia Ponomarenko
Combinatorica
19
(3), 1999, pp. 321-333
A sublinear bipartiteness tester for bounded degree graphs
Oded Goldreich
,
Dana Ron
Combinatorica
19
(3), 1999, pp. 335-373
Fast algorithms for finding
O
(congestion+dilation) packet routing schedules
Tom Leighton
,
Bruce Maggs
,
Andréa W. Richa
Combinatorica
19
(3), 1999, pp. 375-401
Separation of the monotone
NC
hierarchy
Ran Raz
,
Pierre McKenzie
Combinatorica
19
(3), 1999, pp. 403-435
Perfect matchings in
\epsilon
-regular graphs and the blow-up lemma
Vojtech Rödl
,
Andrzej Ruciński
Combinatorica
19
(3), 1999, pp. 437-452
List coloring of random and pseudo-random graphs
Noga Alon
,
Michael Krivelevich
,
Benny Sudakov
Combinatorica
19
(4), 1999, pp. 453-472
Exact bounds for judicious partitions of graphs
B. Bollobás
,
A.D. Scott
Combinatorica
19
(4), 1999, pp. 473-486
List homomorphisms and circular arc graphs
Tomas Feder
,
Pavol Hell
,
Jing Huang
Combinatorica
19
(4), 1999, pp. 487-505
Equivalence in finite-variable logics is complete for polynomial time
Martin Grohe
Combinatorica
19
(4), 1999, pp. 507-532
Seiten 1
2
>