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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The monotone circuit complexity of Boolean functions
N. Alon
,
R.B. Boppana
Combinatorica
7
(1), 1987, pp. 1-22
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem
A. Björner
,
P. Frankl
,
R. Stanley
Combinatorica
7
(1), 1987, pp. 23-34
Threshold functions
B. Bollobás
,
A. Thomason
Combinatorica
7
(1), 1987, pp. 35-38
On some combinatorial properties of algebraic matroids
A. Dress
,
L. Lovász
Combinatorica
7
(1), 1987, pp. 39-48
An application of simultaneous Diophantine approximation in combinatorial optimization
A. Frank
,
éva Tardos
Combinatorica
7
(1), 1987, pp. 49-66
On a pursuit game on Cayley graphs
P. Frankl
Combinatorica
7
(1), 1987, pp. 67-70
Expanding graphs contain all small trees
J. Friedman
,
N. Pippenger
Combinatorica
7
(1), 1987, pp. 71-76
A local characterization of the Johnson scheme
J.I. Hall
Combinatorica
7
(1), 1987, pp. 77-86
Computing the composition factors of a permutation group in polynomial time
E.M. Luks
Combinatorica
7
(1), 1987, pp. 87-100
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
K. Mulmuley
Combinatorica
7
(1), 1987, pp. 101-104
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Combinatorica
7
(1), 1987, pp. 105-120
A canonical restricted version of van der Waerden's theorem
H.-J. Prömel
,
B.L. Rotschild
Combinatorica
7
(1), 1987, pp. 121-130
Sharp concentration of the chromatic number on random graphs
G{n,p}
E. Shamir
,
J. Spencer
Combinatorica
7
(1), 1987, pp. 131-138
Almost linear upper bounds on the length of general Davenport-Schinzel sequences
M. Sharir
Combinatorica
7
(1), 1987, pp. 139-144
On digraphs with no two disjoint directed cycles
C. Thomassen
Combinatorica
7
(1), 1987, pp. 145-150
The smallest
n
-uniform hypergraph with positive discrepancy
N. Alon
,
D.J. Kleitman
,
C. Pomerance
,
M. Saks
,
P. Seymour
Combinatorica
7
(2), 1987, pp. 151-160
An extension of the Erdŏs-Szekeres theorem on large angles
I. Bárány
Combinatorica
7
(2), 1987, pp. 161-170
Graph bisection algorithms with good average case behavior
T.N. Bui
,
S. Chaudhuri
,
F.T. Leighton
,
M. Sipser
Combinatorica
7
(2), 1987, pp. 171-192
On switching path polyhedra
H. Gröflin
Combinatorica
7
(2), 1987, pp. 193-204
Maximum and
k
-th maximal spanning trees of a weighted graph
M. Kano
Combinatorica
7
(2), 1987, pp. 205-214
On a problem of P. Erdŏs concerning property
k
H.L. Abbott
,
A. Liu
Combinatorica
7
(3), 1987, pp. 215-220
Bounds on the convex label number of trees
M. Bern
,
M. Klawe
,
A. Wong
Combinatorica
7
(3), 1987, pp. 221-230
Finding a small 3-connected minor maintaining a fixed minor and a fixed element
R.E. Bixby
,
C.R. Coullard
Combinatorica
7
(3), 1987, pp. 231-242
Reducing prime graphs and recognizing circle graphs
A. Bouchet
Combinatorica
7
(3), 1987, pp. 243-254
Directed cut transversal packing for source-sink connected graphs
P. Feofiloff
,
D.H. Younger
Combinatorica
7
(3), 1987, pp. 255-264
Seiten 1
2
>