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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On Lovász' lattice reduction and the nearest lattice point problem
L. Babai
Combinatorica
6
(1), 1986, pp. 1-14
The asymptotic number of acyclic digraphs I
E.A. Bender
,
L.B. Richmond
,
R.W. Robinson
,
N.C. Wormald
Combinatorica
6
(1), 1986, pp. 15-22
A parity digraph has a kernel
M. Blidia
Combinatorica
6
(1), 1986, pp. 23-28
A size-width inequality for distributive lattices
U. Faigle
,
B. Sands
Combinatorica
6
(1), 1986, pp. 29-34
Constructing a perfect matching is in random NC
R.M. Karp
,
E. Upfal
,
A. Wigderson
Combinatorica
6
(1), 1986, pp. 35-48
Legal coloring of graphs
N. Linial
Combinatorica
6
(1), 1986, pp. 49-54
Balancing vectors in the max norm
J. Spencer
Combinatorica
6
(1), 1986, pp. 55-66
The solution of Graham's greatest common divisor problem
M. Szegedy
Combinatorica
6
(1), 1986, pp. 67-72
On the number of paths and cycles for almost all graphs and digraphs
I. Tomescu
Combinatorica
6
(1), 1986, pp. 73-79
Eigenvalues and expanders
N. Alon
Combinatorica
6
(2), 1986, pp. 83-96
Independent unbiased coin flips from a correlated biased source--a finite state Markov chain
M. Blum
Combinatorica
6
(2), 1986, pp. 97-108
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
H.N. Gabow
,
Z. Galil
,
T. Spencer
,
R.E. Tarjan
Combinatorica
6
(2), 1986, pp. 109-122
An augmenting path algorithm for linear matroid parity
H.N. Gabow
,
M. Stallmann
Combinatorica
6
(2), 1986, pp. 123-150
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
S. Hart
,
M. Sharir
Combinatorica
6
(2), 1986, pp. 151-178
The average-case analysis of some on-line algorithms for bin packing
P.W. Shor
Combinatorica
6
(2), 1986, pp. 179-200
Covering graphs by the minimum number of equivalence relations
N. Alon
Combinatorica
6
(3), 1986, pp. 201-206
Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
N. Alon
Combinatorica
6
(3), 1986, pp. 207-220
Packing and covering a tree by subtrees
I. Bárány
,
J. Edmonds
,
L.A. Wolsey
Combinatorica
6
(3), 1986, pp. 221-234
A non-analytic proof of the Newman-Znám result for disjoint covering systems
M.A. Berger
,
A. Felzenbaum
,
A.S. Fraenkel
Combinatorica
6
(3), 1986, pp. 235-244
A characterization of the minimalbasis of the torus
R. Bodendiek
,
K. Wagner
Combinatorica
6
(3), 1986, pp. 245-260
On the sharpness of a theorem of B. Segre
E. Boros
,
T. Szönyi
Combinatorica
6
(3), 1986, pp. 261-268
Contractible edges in triangle-free graphs
Y. Egawa
,
H. Enomoto
,
A. Saito
Combinatorica
6
(3), 1986, pp. 269-274
On the non-existence of Barker sequences
M. Elia
Combinatorica
6
(3), 1986, pp. 275-278
Orthogonal vectors in the
n
-dimensional cube and codes with missing distances
P. Frankl
Combinatorica
6
(3), 1986, pp. 279-286
On well-quasi-ordering finite graphs by immersion
T. Andreae
Combinatorica
6
(4), 1986, pp. 287-298
Seiten 1
2
>