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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex-colouring edge-weightings
Louigi Addario-Berry
,
Ketan Dalal
,
Colin McDiarmid
,
Bruce A. Reed
,
Andrew Thomason
Combinatorica
27
(1), 2007, pp. 1-12
Codes and Xor graph products
Noga Alon
,
Eyal Lubetzky
Combinatorica
27
(1), 2007, pp. 13-33
Three-color Ramsey numbers for paths
András Gyárfás
,
Miklós Ruszinkó
,
Gábor N. Sárközy
,
Endre Szemerédi
Combinatorica
27
(1), 2007, pp. 35-69
An approximate max-STEINER-TREE-PACKING min-Steiner-cut theorem
Lap Chi Lau
Combinatorica
27
(1), 2007, pp. 71-90
Fully-dynamic min-cut
Mikkel Thorup
Combinatorica
27
(1), 2007, pp. 91-127
On stabilizers of some moieties of the random tournament
Eric Jaligot
Combinatorica
27
(1), 2007, pp. 129-133
The Erdŏs-Pósa property for long circuits
Etienne Birmelé
,
J. Adrian Bondy
,
Bruce A. Reed
Combinatorica
27
(2), 2007, pp. 135-145
How to split antichains in infinite posets
Péter L. Erdŏs
,
Lajos Soukup
Combinatorica
27
(2), 2007, pp. 147-161
A non-existence result for finite projective planes in Lenz-Barlotti class I.4
Dina Ghinelli
,
Dieter Jungnickel
Combinatorica
27
(2), 2007, pp. 163-166
Total colorings of degenerate graphs
Shuji Isobe
,
Xiao Zhou
,
Takao Nishizeki
Combinatorica
27
(2), 2007, pp. 167-182
On the span of a random channel assignment problem
Colin McDiarmid
Combinatorica
27
(2), 2007, pp. 183-203
An approximation scheme for cake division with a linear number of cuts
Jiȓí Sgall
,
Gerhard J. Woeginger
Combinatorica
27
(2), 2007, pp. 205-211
Lossless condensers, unbalanced expanders, and extractors
Amnon Ta-Shma
,
Christopher Umans
,
David Zuckerman
Combinatorica
27
(2), 2007, pp. 213-240
On the chromatic number of pentagon-free graphs of large minimum degree
Carsten Thomassen
Combinatorica
27
(2), 2007, pp. 241-243
On circular flows of graphs
Hong-Jian Lai
,
Rui Xu
,
Cun-Quan Zhang
Combinatorica
27
(2), 2007, pp. 245-246
Packing non-returning
A
-paths
Gyula Pap
Combinatorica
27
(2), 2007, pp. 247-251
Independent systems of representatives in weighted graphs
Ron Aharoni
,
Eli Berger
,
Ran Zvi
Combinatorica
27
(3), 2007, pp. 253-267
On end degrees and infinite cycles in locally finite graphs
Henning Bruhn
,
Maya Stein
Combinatorica
27
(3), 2007, pp. 269-291
Testing of matrix poset properties
Eldar Fischer
,
Ilan Newman
Combinatorica
27
(3), 2007, pp. 293-327
K_4
-free subgraphs of random graphs revisited
S. Gerke
,
H.J. Prömel
,
T. Schickinger
,
A. Steger
,
A. Taraz
Combinatorica
27
(3), 2007, pp. 329-365
Comoputing the integer programming gap
Serkan Hoşten
,
Bernd Sturmfels
Combinatorica
27
(3), 2007, pp. 367-382
Matchings of cycles and paths in directed graphs
Gyula Pap
,
László Szegŏ
Combinatorica
27
(3), 2007, pp. 383-398
Lower bound on the profile of degree pairs in cross-intersecting set systems
Zsuzsanna Szaniszló
,
Zsolt Tuza
Combinatorica
27
(3), 2007, pp. 399-405
Colored graphs without colorful cycles
Richard N. Ball
,
Ales̑ Pultr
,
Petr Vojtȇchovský
Combinatorica
27
(4), 2007, pp. 407-427
Some remarks on the odd Hadwiger's conjecture
Ken-Ichi Kawarabayashi
,
Zi-Xia Song
Combinatorica
27
(4), 2007, pp. 429-438
Seiten 1
2
>