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=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ultrafilters and multidimensional Ramsey theorems
V. Bergelson
,
N. Hindman
Combinatorica
9
, 1989, pp. 1-7
On 3-pushdown graphs with large separators
Z. Galil
,
R. Kannan
,
E. Szemerédi
Combinatorica
9
, 1989, pp. 9-19
Cones of alternating and cut submodular set functions
V.P. Grishuhin
Combinatorica
9
, 1989, pp. 21-32
Cycles and paths in bipartite tournaments with spanning configurations
R. Häggkvist
,
Y. Manoussakis
Combinatorica
9
, 1989, pp. 33-38
The chromatic number of random graphs at the double-jump threshold
T. Luczak
,
J.C. Wierman
Combinatorica
9
, 1989, pp. 39-49
Symmetric designs and geometroids
T.P. Mcdonough
,
V.C. Mavron
Combinatorica
9
, 1989, pp. 51-57
Duality in coherent configurations
A. Neumaier
Combinatorica
9
, 1989, pp. 59-67
On fixing elements in matroid minors
J. Oxley
,
D. Row
Combinatorica
9
, 1989, pp. 69-74
Inseparability graphs of oriented matroids
J.-P. Roudneff
Combinatorica
9
, 1989, pp. 75-84
Solution to a problem of C.D. Godsil regarding bipartite graphs with unique perfect matching
R. Simion
,
D.-S. Cao
Combinatorica
9
, 1989, pp. 85-89
A new lower bound for snake-in-the-box codes
J. Wojciechowski
Combinatorica
9
, 1989, pp. 91-99
On the number of
C_5
's in a triangle-free graph
E. Gyŏri
Combinatorica
9
, 1989, pp. 101-102
A cycle-space invariant of the
<2
-distance-graph in the plane
I. Kr̆iz̆
Combinatorica
9
, 1989, pp. 103-105
Matroids algebraic over
F(t)
are algebraic over
F
B. Lindström
Combinatorica
9
, 1989, pp. 107-109
A dynamic location problem for graphs
F.R.K. Chung
,
R.L. Graham
,
M.E. Saks
Combinatorica
9
, 1989, pp. 111-131
Survival time of a random graph
A.M. Frieze
Combinatorica
9
, 1989, pp. 133-143
Matroid matching in pseudomodular lattices
W. Hochstättler
,
W. Kern
Combinatorica
9
, 1989, pp. 145-152
An extremal problem for Graham-Rothschild parameter words
H. Lefmann
Combinatorica
9
, 1989, pp. 153-160
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
T. Leighton
,
P. Shor
Combinatorica
9
, 1989, pp. 161-187
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
E. Klafszky
,
T. Terlaky
Combinatorica
9
, 1989, pp. 189-198
Factoring polynomials modulo special primes
L. Rónyai
Combinatorica
9
, 1989, pp. 199-206
Asymptotic solution for a new class of forbidden
r
-graphs
A.F. Sidorenko
Combinatorica
9
, 1989, pp. 207-215
Lower bounds for coverings of pairs by large blocks
D.T. Todorov
Combinatorica
9
, 1989, pp. 217-225
A hypergraph-free construction of highly chromatic graphs without short cycles
Igor Kr̆iz̆
Combinatorica
9
, 1989, pp. 227-229
A note on monotone paths in labeled graphs
Jan Reiterman
Combinatorica
9
, 1989, pp. 231-232
Seiten 1
2
>