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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Maximum number of constant weight vertices of the unit
n
-cube contained in a
k
-dimensional subspace
R. Ahlswede
,
H. Aydinian
,
L. Khachatrian
Combinatorica
23
(1), 2003, pp. 5-22
Neighborhood complexes of stable Kneser graphs
Anders Björner
,
Mark de Longueville
Combinatorica
23
(1), 2003, pp. 23-34
Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
Béla Csaba
,
Ali Shokoufandeh
,
Endre Szemerédi
Combinatorica
23
(1), 2003, pp. 35-72
On the spread of finite simple groups
Robert M. Guralnick
,
Aner Shalev
Combinatorica
23
(1), 2003, pp. 73-87
Some remarks on the simultaneous chromatic number
András Hajnal
,
Péter Komjáth
Combinatorica
23
(1), 2003, pp. 89-104
For which densities are random triangle-free graphs almost surely bipartite?
Deryk Osthus
,
Hans Jürgen Prömel
,
Anusch Taraz
Combinatorica
23
(1), 2003, pp. 105-150
Davenport-Schinzel trees
Pavel Valtr
Combinatorica
23
(1), 2003, pp. 151-184
Graph connectivity after path removal
Guantao Chen
,
Ronald J. Gould
,
Xingxing Yu
Combinatorica
23
(2), 2003, pp. 185-203
Approximating CVP to within almost-polynomial factors is
NP
-hard
I. Dinur
,
G. Kindler
,
R. Raz
,
S. Safra
Combinatorica
23
(2), 2003, pp. 205-243
Bounds on the Chvátal rank of polytopes in the
0/1
-cube
Friedrich Eisenbrand
,
Andreas S. Schulz
Combinatorica
23
(2), 2003, pp. 245-261
Maximal collections of intersecting arithmetic progressions
Kevin Ford
Combinatorica
23
(2), 2003, pp. 263-281
Imperfect and nonideal clutters: A common approach
Grigor Gasparyan
,
Myriam Preissmann
,
András Sebŏ
Combinatorica
23
(2), 2003, pp. 283-302
Heavy transversals and indecomposable hypergraphs
André E. Kézdy
,
Jenŏ Lehel
,
Robert C. Powers
Combinatorica
23
(2), 2003, pp. 303-310
Small complete arcs in projective planes
J.H. Kim
,
V.H. Vu
Combinatorica
23
(2), 2003, pp. 311-363
Improved low-degree testing and its applications
Sanjeev Arora
,
Madhu Sudan
Combinatorica
23
(3), 2003, pp. 365-426
Inequalities for
cd
-indices of joins and products of polytopes
Richard Ehrenborg
,
Harold Fox
Combinatorica
23
(3), 2003, pp. 427-452
K_6
-minors in projective planar graphs
Gas̑per Fijavz̑
,
Bojan Mohar
Combinatorica
23
(3), 2003, pp. 453-465
Sharp concentration of the number of submaps in random planar triangulations
Zhicheng Gao
,
Nicholas C. Wormald
Combinatorica
23
(3), 2003, pp. 467-486
Ramanujan graphs with small girth
Yair Glasner
Combinatorica
23
(3), 2003, pp. 487-502
Fast cycle canceling algorithms for minimum cost submodular flow
Satoru Iwata
,
S. Thomas McCormick
,
Maiko Shigeno
Combinatorica
23
(3), 2003, pp. 503-525
A sharp bound for the number of sets that pairwise intersect at
k
-positive values
Hunter S. Snevily
Combinatorica
23
(3), 2003, pp. 527-533
An upper bound for the cardinality of an
s
-distance set in Euclidean space
Etsuko Bannai
,
Kazuki Kawasaki
,
Yusuke Nitamizu
,
Teppei Sato
Combinatorica
23
(4), 2003, pp. 535-557
Set systems with few disjoint pairs
Béla Bollobá
,
Imre Leader
Combinatorica
23
(4), 2003, pp. 559-570
The fixing block method in combinatorics on words
James D. Currie
,
Cameron W. Pierce
Combinatorica
23
(4), 2003, pp. 571-584
On a generalization of Rédei's theorem
András Gács
Combinatorica
23
(4), 2003, pp. 585-598
Seiten 1
2
>