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=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight sets and
m
-ovoids of generalised quadrangles
John Bamberg
,
Maska Law
,
Tim Penttila
Combinatorica
29
(1), 2009, pp. 1-17
Line partitions of internal points to a conic in
PG(2,q)
Massimo Giulietti
Combinatorica
29
(1), 2009, pp. 19-25
The superstar packing problem
Marek Janata
,
Jácint Szabó
Combinatorica
29
(1), 2009, pp. 27-48
Coloring number and on-line Ramsey theory for graphs and hypergraphs
H.A. Kierstead
,
Goran Konjevod
Combinatorica
29
(1), 2009, pp. 49-64
The minimum degree threshold for perfect graph packings
Daniela Kühn
,
Deryk Osthus
Combinatorica
29
(1), 2009, pp. 65-107
Drawing 4-Pfaffian graphs on the torus
Serguei Norine
Combinatorica
29
(1), 2009, pp. 109-119
On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary
Werner Schwärzler
Combinatorica
29
(1), 2009, pp. 121-126
A note on a spanning 3-tree
Masao Tsugaki
Combinatorica
29
(1), 2009, pp. 127-129
The distribution of the root degree of a random permutation
Béla Bollobás
,
Boris Pittel
Combinatorica
29
(2), 2009, pp. 131-151
Density theorems for bipartite graphs and related Ramsey-type results
Jacob Fox
,
Benny Sudakov
Combinatorica
29
(2), 2009, pp. 153-196
Arc-disjoint in-trees in directed graphs
Naoyuki Kamiyama
,
Naoki Katoh
,
Atsushi Takizawa
Combinatorica
29
(2), 2009, pp. 197-214
Highly parity linked graphs
Ken-Ichi Kawarabayashi
,
Bruce Reed
Combinatorica
29
(2), 2009, pp. 215-225
Ramsey goodness and beyond
Vladimir Nikiforov
,
Cecil C. Rousseau
Combinatorica
29
(2), 2009, pp. 227-262
Embeddings and Ramsey numbers of sparse
k
-uniform hypergraphs
Oliver Cooley
,
Nikolaos Fountoulakis
,
Daniela Kühn
,
Deryk Osthus
Combinatorica
29
(3), 2009, pp. 263-297
Hamiltonian cycles in Dirac graphs
Bill Cuckler
,
Jeff Kahn
Combinatorica
29
(3), 2009, pp. 299-326
Entropy bounds for perfect matchings and Hamiltonian cycles
Bill Cuckler
,
Jeff Kahn
Combinatorica
29
(3), 2009, pp. 327-335
On a graph property generalizing planarity and flatness
Hein van der Holst
,
Rudi Pendavingh
Combinatorica
29
(3), 2009, pp. 337-361
On the Fourier spectrum of symmetric Boolean functions
Mihail N. Kolountzakis
,
Richard J. Lipton
,
Evangelos Markakis
,
Aranyak Mehta
,
Nisheeth K. Vishnoi
Combinatorica
29
(3), 2009, pp. 363-387
Uniformly cross intersecting families
Noga Alon
,
Eyal Lubetzky
Combinatorica
29
(4), 2009, pp. 389-431
The universality of Hom complexes of graphs
Anton Dochtermann
Combinatorica
29
(4), 2009, pp. 433-448
Colourings of the Cartesian product of graphs and multiplicative Sidon sets
Attila Pór
,
David R. Wood
Combinatorica
29
(4), 2009, pp. 449-466
Generalizations of the removal lemma
Vojtȇch Rödl
,
Mathias Schacht
Combinatorica
29
(4), 2009, pp. 467-501
Tilings of the integers can have superpolynomial periods
John P. Steinberger
Combinatorica
29
(4), 2009, pp. 503-509
Punctured combinatorial Nullstellensätze
Simeon Ball
,
Oriol Serra
Combinatorica
29
(5), 2009, pp. 511-522
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
Saugata Basu
,
Richard Pollack
,
Marie-Françoise Roy
Combinatorica
29
(5), 2009, pp. 523-546
Seiten 1
2
>