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=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear algebra methods for forbidden configurations
Richard P. Anstee
,
Balin Fleming
Combinatorica
31
(1), 2011, pp. 1-19
Eulerian edge sets in locally finite graphs
Eli Berger
,
Henning Bruhn
Combinatorica
31
(1), 2011, pp. 21-38
On
Ks
-free subgraphs in
Ks+k
-free graphs and vertex Folkman numbers
Andrzej Dudek
,
Vojtȇch Rödl
Combinatorica
31
(1), 2011, pp. 39-53
Destroying cycles in digraphs
Molly Dunkum
,
Peter Hamburger
,
Attila Pór
Combinatorica
31
(1), 2011, pp. 55-66
Monochromatic integers adding to polynomials of prime variables
Hongze Li
,
Hao Pan
Combinatorica
31
(1), 2011, pp. 67-83
The structure of hereditary properties and 2-coloured multigraphs
Edward Marchant
,
Andrew Thomason
Combinatorica
31
(1), 2011, pp. 85-93
Packing cycles with modularity constraints
Paul Wollan
Combinatorica
31
(1), 2011, pp. 95-126
Chevalley's theorem with restricted variables
David Brink
Combinatorica
31
(1), 2011, pp. 127-130
The number of
Km,m
-free graphs
József Balogh
,
Wojciech Samotij
Combinatorica
31
(2), 2011, pp. 131-150
A
q
-analogue of the FKG inequality and some applications
Anders Björner
Combinatorica
31
(2), 2011, pp. 151-164
Hereditary quasirandom properties of hypergraphs
Domingos Dellamonica
,
Vojtȇch Rödl
Combinatorica
31
(2), 2011, pp. 165-182
An infinite combinatorial statement with a poset parameter
Pierre Gillibert
,
Friedrich Wehrung
Combinatorica
31
(2), 2011, pp. 183-200
The constructive characterization of (
\kappa\ell
)-edge-connected digraphs
Erika R. Kovács
,
László A. Végh
Combinatorica
31
(2), 2011, pp. 201-223
Ramsey theorems for product of finite sets with submeasures
Saharon Shelah
,
Jindȓich Zapletal
Combinatorica
31
(2), 2011, pp. 225-244
Affine extractors over prime fields
Amir Yehudayoff
Combinatorica
31
(2), 2011, pp. 245-256
Some constructions of highly arc-transitive digraphs
Daniela Amato
,
John K. Truss
Combinatorica
31
(3), 2011, pp. 257-283
Binary subtrees with few labeled paths
Rodney G. Downey
,
Noam Greenberg
,
Carl G. Jockusch
,
Kevin G. Milans
Combinatorica
31
(3), 2011, pp. 285-303
Towards dimension expanders over finite fields
Zeev Dvir
,
Amir Shpilka
Combinatorica
31
(3), 2011, pp. 305-320
A local criterion for Tverberg graphs
Alexander Engström
Combinatorica
31
(3), 2011, pp. 321-332
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
Zohar S. Karnin
,
Amir Shpilka
Combinatorica
31
(3), 2011, pp. 333-364
On planarity of compact, locally connected, metric spaces
R. Bruce Richter
,
Brendan Rooney
,
Carsten Thomassen
Combinatorica
31
(3), 2011, pp. 365-376
Erratum to ``Punctured combinatorial Nullstellensätze''
Simeon Ball
,
Oriol Serra
Combinatorica
31
(3), 2011, pp. 377-378
Limitations of VCG-based mechanisms
Shahar Dobzinski
,
Noam Nisan
Combinatorica
31
(4), 2011, pp. 379-396
Packing directed circuits exactly
Bertrand Guenin
,
Robin Thomas
Combinatorica
31
(4), 2011, pp. 397-421
On the chromatic number of random geometric graphs
Colin Mcdiarmid
,
Tobias Müller
Combinatorica
31
(4), 2011, pp. 423-488
Seiten 1
2
>