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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partitioning graphs of bounded tree-width
Guoli Ding
,
Bogdan Oporowski
,
Daniel P. Sanders
,
Dirk Vertigan
Combinatorica
18
(1), 1998, pp. 1-12
On linear combinatorics II - Structure theorems via additive number theory
György Elekes
Combinatorica
18
(1), 1998, pp. 13-25
Boolean functions with low average sensitivity depend on few coordinates
Ehud Friedgut
Combinatorica
18
(1), 1998, pp. 27-35
Primal-dual approximation algorithms for feedback problems in planar graphs
Michel X. Goemans
,
David P. Williamson
Combinatorica
18
(1), 1998, pp. 37-59
A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizations
Toshihide Ibaraki
,
Alexander V. Karzanov
,
Hiroshi Nagamochi
Combinatorica
18
(1), 1998, pp. 61-83
Log-concave functions and poset probabilities
Jeff Kahn
,
Yang Yu
Combinatorica
18
(1), 1998, pp. 85-99
An extremal problem for random graphs and the number of graphs with large even-girth
Y. Kohayakawa
,
B. Kreuter
,
A. Steger
Combinatorica
18
(1), 1998, pp. 101-120
Non-expansive hashing
Nathan Linial
,
Ori Sasson
Combinatorica
18
(1), 1998, pp. 121-132
On small blocking sets
Pompeo Polito
,
Olga Polverino
Combinatorica
18
(1), 1998, pp. 133-137
On the simplest inverse problem for sums of sets in several dimensions
Yonutz Stanchescu
Combinatorica
18
(1), 1998, pp. 139-149
Approximating probability distributions using small sample spaces
Yossi Azar
,
Rajeev Motwani
,
Joseph (Seffi) Naor
Combinatorica
18
(2), 1998, pp. 151-171
The combinatorics of biased riffle shuffles
Jason Fulman
Combinatorica
18
(2), 1998, pp. 173-184
A two-spheres problem on homogeneous trees
Francisco Javier González Vieli
Combinatorica
18
(2), 1998, pp. 185-189
On a construction of infinite families of regular Cayley maps
Robert Jajcay
Combinatorica
18
(2), 1998, pp. 191-199
Random matchings in reagular graphs
Jeff Kahn
,
Jeong Han Kim
Combinatorica
18
(2), 1998, pp. 201-226
The distance-regular graphs with intersection number
\alpha_1\neq0
and with an eigenvalue
-1-(b_1/2)
J.H. Koolen
Combinatorica
18
(2), 1998, pp. 227-234
On large systems of sets with no large weak
\Delta
-subsystems
A.V. Kostochka
,
V. Rödl
Combinatorica
18
(2), 1998, pp. 235-240
A bound on the total chromatic number
Michael Molloy
,
Bruce Reed
Combinatorica
18
(2), 1998, pp. 241-280
On the relation between two minor-monotone graph parameters
R. Pendavingh
Combinatorica
18
(2), 1998, pp. 281-292
Edge-coloring cliques with three colors on all 4-cliques
Dhruv Mubayi
Combinatorica
18
(2), 1998, pp. 293-296
On the number of triangulations of planar point sets
Raimund Seidel
Combinatorica
18
(2), 1998, pp. 297-299
The Shannon capacity of a union
Noga Alon
Combinatorica
18
(3), 1998, pp. 301-310
Random minimum length spanning trees in regular graphs
Andrew Beveridge
,
Alan Frieze
,
Colin McDiarmid
Combinatorica
18
(3), 1998, pp. 311-333
Approximate homomorphisms
Ilijas Farah
Combinatorica
18
(3), 1998, pp. 335-348
Randomized simplex algorithms on Klee-Minty cubes
Bernd Gärtner
,
Martin Henk
,
Günter M. Ziegler
Combinatorica
18
(3), 1998, pp. 349-372
Seiten 1
2
>