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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A random NC algorithm for depth first search
A. Aggarwal
,
R.J. Anderson
Combinatorica
8
(1), 1988, pp. 1-12
Optima of dual integer linear programs
R. Aharoni
,
P. Erdŏs
,
N. Linial
Combinatorica
8
(1), 1988, pp. 13-20
The chromatic number of random graphs
B. Bollobás
Combinatorica
8
(1), 1988, pp. 49-55
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs
A.E. Brouwer
,
A. Neumaier
Combinatorica
8
(1), 1988, pp. 57-61
On multiplicative graphs and the product conjecture
R. Häggkvist
,
P. Hell
,
D.J. Miller
,
V. Neumann Lara
Combinatorica
8
(1), 1988, pp. 63-74
Dual vectors and lower bounds for the nearest lattice point problem
J. Håstad
Combinatorica
8
(1), 1988, pp. 75-81
Small topological complete subgraphs of ``dense'' graphs
A. Kostochka
,
L. Pyber
Combinatorica
8
(1), 1988, pp. 83-86
A generalization of the Ingleton-Main lemma and a class of non-algebraic matroids
B. Lindström
Combinatorica
8
(1), 1988, pp. 87-90
Rubber bands, convex embeddings and graph connectivity
N. Linial
,
L. Lovász
,
A. Wigderson
Combinatorica
8
(1), 1988, pp. 91-102
The Schrijver system of odd join polyhedra
A. Sebŏ
Combinatorica
8
(1), 1988, pp. 103-116
Improved lower bounds on the length of Davenport-Schinzel sequences
M. Sharir
Combinatorica
8
(1), 1988, pp. 117-124
The classification of distance-regular graphs of type IIB
P. Terwilliger
Combinatorica
8
(1), 1988, pp. 125-132
A short proof of the nonuniform Ray-Chaudhuri--Wilson inequality
L. Babai
Combinatorica
8
(1), 1988, pp. 133-135
The edge-density of 4-critical planar graphs
B. Grünbaum
Combinatorica
8
(1), 1988, pp. 137-139
The gap between monotone and non-monotone circuit complexity is exponential
é. Tardos
Combinatorica
8
(1), 1988, pp. 141-142
Hook-free colorings and a problem of Hanson
M. Aigner
,
D. Grieser
Combinatorica
8
, 1988, pp. 143-148
Hereditary modular graphs
H.-J. Bandelt
Combinatorica
8
, 1988, pp. 149-157
On a lattice point problem of L. Moser II
József Beck
Combinatorica
8
, 1988, pp. 159-176
Matrices with prescribed row, column and block sums
Zh.A. Chernyak
,
A.A. Chernyak
Combinatorica
8
, 1988, pp. 177-184
A lower bound on strictly non-blocking networks
J. Friedman
Combinatorica
8
, 1988, pp. 185-188
Improved processor bounds for combinatorial problems in RNC
Z. Galil
,
V. Pan
Combinatorica
8
, 1988, pp. 189-200
On a relation between a cyclic relative difference set associated with the quadratic extensions of a finite field and the Szekeres difference sets
Mieko Yamada
Combinatorica
8
, 1988, pp. 207-216
Branchings in rooted graphs and the diameter of greedoids
G.M. Ziegler
Combinatorica
8
, 1988, pp. 217-234
A lower bound for finding predecessors in Yao's cell probe model
M. Ajtai
Combinatorica
8
, 1988, pp. 235-247
Intersection theorems in permutation groups
P.J. Cameron
,
M. Deza
,
P. Frankl
Combinatorica
8
, 1988, pp. 249-260
Seiten 1
2
>