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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Type-II matrices and combinatorial structures
Ada Chan
,
Chris Godsil
Combinatorica
30
(1), 2010, pp. 1-24
Characterizations of finite classical polar spaces by intersection numbers with hyperplanes and spaces of codimension 2
Stefaan De Winter
,
Jeroen Schillewaert
Combinatorica
30
(1), 2010, pp. 25-45
Almost Euclidean subspaces of
\ell_{1}^{N}
via expander codes
Venkatesan Guruswami
,
James R. Lee
,
Alexander Razborov
Combinatorica
30
(1), 2010, pp. 47-68
An inequality for Tutte polynomials
Bill Jackson
Combinatorica
30
(1), 2010, pp. 69-81
Partition properties of the dense local order and a colored version of Milliken's theorem
Claude Laflamme
,
Lionel Nguyen Van Thé
,
Norbert W. Sauer
Combinatorica
30
(1), 2010, pp. 83-104
Online vertex-coloring games in random graphs
Martin Marciniszyn
,
Reto Spöhel
Combinatorica
30
(1), 2010, pp. 105-123
On a poset of trees
Péter Csikvári
Combinatorica
30
(2), 2010, pp. 125-137
On the pseudo-randomness of subsets related to primitive roots
Cécile Dartyge
,
András Sárközy
,
Mihály Szalay
Combinatorica
30
(2), 2010, pp. 139-162
A superadditivity and submultiplicativity property for cardinalities of sumsets
Katalin Gyarmati
,
Máté Matolcsi
,
Imre Z. Ruzsa
Combinatorica
30
(2), 2010, pp. 163-174
Set systems without a simplex or a cluster
Peter Keevash
,
Dhruv Mubayi
Combinatorica
30
(2), 2010, pp. 175-200
Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
Henry A. Kierstead
,
Alexandr V. Kostochka
Combinatorica
30
(2), 2010, pp. 201-216
A fast algorithm for equitable coloring
Henry A. Kierstead
,
Alexandr V. Kostochka
,
Marcelo Mydlarz
,
Endre Szemerédi
Combinatorica
30
(2), 2010, pp. 217-224
Structure of large incomplete sets in Abelian groups
H. Van Vu
Combinatorica
30
(2), 2010, pp. 225-237
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Raphael Yuster
Combinatorica
30
(2), 2010, pp. 239-246
A note on disjoint arborescences
Satoru Fujishige
Combinatorica
30
(2), 2010, pp. 247-252
New hook length formulas for binary trees
Guo-Niu Han
Combinatorica
30
(2), 2010, pp. 253-256
Formulae and growth rates of high-dimensional polycubes
Ronnie Barequet
,
Gill Barequet
,
Günter Rote
Combinatorica
30
(3), 2010, pp. 257-275
Hypergraphs with independent neighborhoods
Tom Bohman
,
Alan Frieze
,
Dhruv Mubayi
,
Oleg Pikhurko
Combinatorica
30
(3), 2010, pp. 277-293
Metric packing for
K_3+K_3
Hiroshi Hirai
Combinatorica
30
(3), 2010, pp. 295-326
New degree bounds for polynomial threshold functions
Ryan O'Donnell
,
Rocco A. Servedio
Combinatorica
30
(3), 2010, pp. 327-358
A new approach to the Ramsey-type games and the Gowers dichotomy in
F
-spaces
George Androulakis
,
Stephen J. Dilworth
,
Nigel J. Kalton
Combinatorica
30
(4), 2010, pp. 359-385
The three-in-a-tree problem
Maria Chudnovsky
,
Paul Seymour
Combinatorica
30
(4), 2010, pp. 387-417
Locally finite homogeneous graphs
Shawn Hedman
,
Wai Yan Pong
Combinatorica
30
(4), 2010, pp. 419-434
A theorem of Cohen on parapolar spaces
Ernest E. Shult
,
Koen Thas
Combinatorica
30
(4), 2010, pp. 435-444
A randomized embedding algorithm for trees
Benny Sudakov
,
Jan Vondrák
Combinatorica
30
(4), 2010, pp. 445-470
Seiten 1
2
>