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
[1]
Hilfe
Suche: Journal=Combinatorica AND YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decomposing simple permutations, with enumerative consequences
Robert Brignall
,
Sophie Huczynska
,
Vincent Vatter
Combinatorica
28
(4), 2008, pp. 385-400
Perfect difference sets constructed from Sidon sets
Javier Cilleruelo
,
Melvyn B. Nathanson
Combinatorica
28
(4), 2008, pp. 401-414
Deterministic extractors for affine sources over large fields
Ariel Gabizon
,
Ran Raz
Combinatorica
28
(4), 2008, pp. 415-440
On the critical pair theory in Abelian groups: Beyond Chowla's theorem
Yahya O. Hamidoune
,
Oriol Serra
,
Gilles Zémor
Combinatorica
28
(4), 2008, pp. 441-467
On a graph packing conjecture by Bollobás, Eldridge and Catlin
Hemanshu Kaul
,
Alexandr Kostochka
,
Gexin Yu
Combinatorica
28
(4), 2008, pp. 469-485
Hadamard matrices of order 764 exist
Dragomir Z̑. Doković
Combinatorica
28
(4), 2008, pp. 487-489
The rectifiability threshold in Abelian groups
Vsevolod F. Lev
Combinatorica
28
(4), 2008, pp. 491-497
Erratum to ``Three-color Ramsey numbers for paths''
András Gyárfás
,
Miklós Ruszinkó
,
Gábor N. Sárközy
,
Endre Szemerédi
Combinatorica
28
(4), 2008, pp. 499-502
On the measure of intersecting families, uniqueness and stability
Ehud Friedgut
Combinatorica
28
(5), 2008, pp. 503-528
Two-point concentration in random geometric graphs
Tobias Müller
Combinatorica
28
(5), 2008, pp. 529-545
Product set estimates for non-commutative groups
Terence Tao
Combinatorica
28
(5), 2008, pp. 547-594
Graph-like continua, augmenting arcs, and Menger's Theorem
Carsten Thomassen
,
Antoine Vella
Combinatorica
28
(5), 2008, pp. 595-623
Optimal strong parity edge-coloring of complete graphs
David P. Bunde
,
Kevin Milans
,
Douglas B. West
,
Hehui Wu
Combinatorica
28
(6), 2008, pp. 625-632
Points surrounding the origin
Andreas F. Holmsen
,
János Pach
,
Helge Tverberg
Combinatorica
28
(6), 2008, pp. 633-644
On the rigidity of molecular graphs
Bill Jackson
,
Tibor Jordán
Combinatorica
28
(6), 2008, pp. 645-658
Counting canonical partitions in the random graph
Jean A. Larson
Combinatorica
28
(6), 2008, pp. 659-678
The parity problem of polymatroids without double circuits
Márton Makai
,
Jácint Szabó
Combinatorica
28
(6), 2008, pp. 679-692
When does the giant component bring unsatisfiability?
Michael Molloy
Combinatorica
28
(6), 2008, pp. 693-734
Quasi-randomness and the distribution of copies of a fixed graph
Asaf Shapira
Combinatorica
28
(6), 2008, pp. 735-745
Seiten
<
1
2