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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
How to find groups? (and how to use them in Erdŏs geometry?)
György Elekes
,
Endre Szabó
Combinatorica
32
(5), 2012, pp. 537-571
Disproof of the neighborhood conjecture with implications to SAT
Heidi Gebauer
Combinatorica
32
(5), 2012, pp. 573-587
Alon's Nullstellensatz for multisets
Géza Kós
,
Lajos Rónyai
Combinatorica
32
(5), 2012, pp. 589-605
Equivalence of polynomial conjectures in additive combinatorics
Shachar Lovett
Combinatorica
32
(5), 2012, pp. 607-618
On a problem of Erdŏs and Rothschild on edges in triangles
Jacob Fox
,
Po-Shen Loh
Combinatorica
32
(6), 2012, pp. 619-628
Translational tilings by a polytope, with multiplicity
Nick Gravin
,
Sinai Robins
,
Dmitry Shiryaev
Combinatorica
32
(6), 2012, pp. 629-648
Transitivity conditions in infinite graphs
Matthias Hamann
,
Julian Pott
Combinatorica
32
(6), 2012, pp. 649-688
Analogues of the central point theorem for families with
d
-intersection property in
\mathbb R^d
Roman N. Karasev
Combinatorica
32
(6), 2012, pp. 689-702
Degree bounded matroids and submodular flows
Tamás Király
,
Lap Chi Lau
,
Mohit Singh
Combinatorica
32
(6), 2012, pp. 703-720
New proofs of Plünnecke-type estimates for product sets in groups
Giorgis Petridis
Combinatorica
32
(6), 2012, pp. 721-733
The Erdŏs-Ko-Rado theorem for twisted Grassmann graphs
Hajime Tanaka
Combinatorica
32
(6), 2012, pp. 735-740
Seiten
<
1
2