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 YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
Omer Angel
,
Abraham D. Flaxman
,
David B. Wilson
Combinatorica
32
(1), 2012, pp. 1-33
Monotonicity testing and shortest-path routing on the cube
Jop Briët
,
Sourav Chakraborty
,
David García-Soriano
,
Arie Matsliah
Combinatorica
32
(1), 2012, pp. 35-53
Three notions of tropical rank for symmetric matrices
Dustin Cartwright
,
Melody Chan
Combinatorica
32
(1), 2012, pp. 55-84
Acute triangulations of polyhedra and
\mathbb R^N
Eryk Kopczyński
,
Igor Pak
,
Piotr Przytycki
Combinatorica
32
(1), 2012, pp. 85-110
On the chromatic numbers of spheres in
\mathbb R^N
A.M. Raigorodskii
Combinatorica
32
(1), 2012, pp. 111-123
Projections, entropy and sumsets
Paul Balister
,
Béla Bollobás
Combinatorica
32
(2), 2012, pp. 125-141
Almost all triangle-free triple systems are tripartite
József Balogh
,
Dhruv Mubayi
Combinatorica
32
(2), 2012, pp. 143-169
On the Ramsey multiplicity of complete graphs
David Conlon
Combinatorica
32
(2), 2012, pp. 171-186
3-uniform hypergraphs avoiding a given odd cycle
Ervin Gyŏri
,
Nathan Lemons
Combinatorica
32
(2), 2012, pp. 187-203
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Hao Huang
,
Benny Sudakov
Combinatorica
32
(2), 2012, pp. 205-219
The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem
Marcus Isaksson
,
Guy Kindler
,
Elchanan Mossel
Combinatorica
32
(2), 2012, pp. 221-250
Packing seagulls
Maria Chudnovsky
,
Paul Seymour
Combinatorica
32
(3), 2012, pp. 251-282
Finding minimum clique capacity
Maria Chudnovsky
,
Sang-Il Oum
,
Paul Seymour
Combinatorica
32
(3), 2012, pp. 283-287
Treewidth computation and extremal combinatorics
Fedor V. Fomin
,
Yngve Villanger
Combinatorica
32
(3), 2012, pp. 289-308
Applications of character estimates to statistical problems for the symmetric group
Jan-Christoph Schlage-Puchta
Combinatorica
32
(3), 2012, pp. 309-323
Universality among graphs omitting a complete bipartite graph
Saharon Shelah Shelah
Combinatorica
32
(3), 2012, pp. 325-362
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
Terence Tao
,
Van Vu
Combinatorica
32
(3), 2012, pp. 363-372
A unifying approach to splitting-off
Attila Bernáth
,
Tamás Király
Combinatorica
32
(4), 2012, pp. 373-401
Perfect matchings in planar cubic graphs
Maria Chudnovsky
,
Paul Seymour
Combinatorica
32
(4), 2012, pp. 403-424
Density and Ramsey type results on algebraic equations with restricted solution sets
Péter Csikvári
,
Katalin Gyarmati
,
András Sárközy
Combinatorica
32
(4), 2012, pp. 425-449
The Bollobás-Thomason conjecture for 3-uniform hypergraphs
John Haslegrave
Combinatorica
32
(4), 2012, pp. 451-471
Remarks on a Ramsey theory for trees
János Pach
,
Gábor Tardos
,
József Solymosi
Combinatorica
32
(4), 2012, pp. 473-482
Complete subgraphs in multipartite graphs
Florian Pfender Pfender
Combinatorica
32
(4), 2012, pp. 483-495
Combinatorial problems in finite fields and Sidon sets
Javier Cilleruelo
Combinatorica
32
(5), 2012, pp. 497-511
On two problems in graph Ramsey theory
David Conlon
,
Jacob Fox
,
Benny Sudakov
Combinatorica
32
(5), 2012, pp. 513-535
Seiten 1
2
>