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=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Monotone path systems in simple regions
K. Cameron
,
H. Sachs
Combinatorica
14
(1), 1994, pp. 1-21
Bounding the vertex cover number of a hypergraph
Guo-Li Ding
,
Paul Seymour
,
Peter Winkler
Combinatorica
14
(1), 1994, pp. 23-34
Spectral properties of threshold functions
Craig Gotsman
,
Nathan Linial
Combinatorica
14
(1), 1994, pp. 35-50
A characterisation of spreads ovally-derived from Desarguesian spreads
V. Jha
,
N.L. Johnson
Combinatorica
14
(1), 1994, pp. 51-61
Nuclei of point sets of size
q + 1
contained in the union of two lines in
PG(2,q)
G. Korchmáros
,
F. Mazzocca
Combinatorica
14
(1), 1994, pp. 63-69
A theory of alternating paths and blossoms for proving correctness of the
O(\sqrt{V} E)
general graph maximum matching algorithm
Vijay V. Vazirani
Combinatorica
14
(1), 1994, pp. 71-109
On the size of a blocking set in
PG(2,p)
Aart Blokhuis
Combinatorica
14
(1), 1994, pp. 111-114
Density results for uniform families
P. Frankl
,
M. Watanabe
Combinatorica
14
(1), 1994, pp. 115-119
The complexity of a class of infinite graphs
P. Komjáth
,
J. Pach
Combinatorica
14
(1), 1994, pp. 121-125
Crossing families
B. Aronov
,
P. Erdös
,
W. Goddard
,
D.J. Kleitman
,
M. Klugerman
,
J. Pach
,
L.J. Schulman
Combinatorica
14
(2), 1994, pp. 127-134
The expressive power of voting polynomials
J. Aspnes
,
R. Beigel
,
M. Furst
,
S. Rudich
Combinatorica
14
(2), 1994, pp. 135-148
On the number of nowhere zero points in linear mappings
R.D. Baker
,
J. Bonin
,
F. Lazebnik
,
E. Shustin
Combinatorica
14
(2), 1994, pp. 149-157
On the divisibility of homogeneous hypergraphs
M. El-Zahar
,
N. Sauer
Combinatorica
14
(2), 1994, pp. 159-165
Packet routing and job-shop scheduling in
O(\mbox{congestion} + \mbox{dilation})
steps
F.T. Leighton
,
Bruce M. Maggs
,
Satish B. Rao
Combinatorica
14
(2), 1994, pp. 167-186
Classifying vertex-transitive graphs whose order is a product of two primes
D. Marus̑ic̑
,
R. Scapellato
Combinatorica
14
(2), 1994, pp. 187-201
Communication in bounded depth circuits
P. Pudlák
Combinatorica
14
(2), 1994, pp. 203-216
Call routing and the ratcatcher
P.D. Seymour
,
R. Thomas
Combinatorica
14
(2), 1994, pp. 217-241
Cycles through
k
vertices in bipartite tournaments
J. Bang-Jensen
,
Y. Manoussakis
Combinatorica
14
(2), 1994, pp. 243-246
Minimally 3-connected isotropic systems
L. Allys
Combinatorica
14
(2), 1994, pp. 247-262
A statistical theorem of set addition
Antal Balog
,
Endre Szemerédi
Combinatorica
14
(2), 1994, pp. 263-268
On IP sets and central sets
Vitaly Bergelson
,
Neil Hindman
Combinatorica
14
(2), 1994, pp. 269-277
On
IP^*
sets and central sets
Vitaly Bergelson
,
Neil Hindman
Combinatorica
14
(3), 1994, pp. 269-277
An extension of the Erdös-Stone theorem
B. Bollobás
,
Y. Kohayakawa
Combinatorica
14
(2), 1994, pp. 279-286
An extension of the Erdŏs-Stone theorem
B. Bollobás
,
Y. Kohayakawa
Combinatorica
14
(3), 1994, pp. 279-286
The prison yard problem
Zoltán Füredi
,
D.J. Kleitman
Combinatorica
14
(2), 1994, pp. 287-300
Seiten 1
2
>