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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The number of orientations having no fixed tournament
Noga Alon
,
Raphael Yuster
Combinatorica
26
(1), 2006, pp. 1-16
Global connectivity and expansion: Long cycles and factors in
f
-connected graphs
Stephan Brandt
,
Hajo Broersma
,
Reinhard Diestel
,
Matthias Kriesell
Combinatorica
26
(1), 2006, pp. 17-36
Weighted non-trivial multiply intersecting families
Peter Frankl
,
Norihide Tokushige
Combinatorica
26
(1), 2006, pp. 37-46
Large discrepancy in homogenous quasi-arithmetic progressions
Robert Hochberg
Combinatorica
26
(1), 2006, pp. 47-64
Flattening antichains
Ákos Kisvölcsey
Combinatorica
26
(1), 2006, pp. 65-82
Restrictions on smallest counterexamples to the 5-flow conjecture
Martin Kochol
Combinatorica
26
(1), 2006, pp. 83-89
The number of unique-sink orientations of the hypercube
Jiȓí Matous̑ek
Combinatorica
26
(1), 2006, pp. 91-99
On the approximability of the Traveling Salesman Problem
Christos H. Papadimitriou
,
Santosh Vempala
Combinatorica
26
(1), 2006, pp. 101-120
Density conditions for triangles in multipartite graphs
Adrian Bondy
,
Jian Shen
,
Stéphan Thomassé
,
Carsten Thomassen
Combinatorica
26
(2), 2006, pp. 121-131
A linear bound on the diameter of the transportation polytope
Graham Brightwell
,
Jan van den Heuvel
,
Leen Stougie
Combinatorica
26
(2), 2006, pp. 133-139
On the parameterized intractability of motif search problems
Michael R. Fellows
,
Jens Gramm
,
Rolf Niedermeier
Combinatorica
26
(2), 2006, pp. 141-167
Colorings of plane graphs with no rainbow faces
Veselin Jungić
,
Daniel Král'
,
Riste S̑krekovski
Combinatorica
26
(2), 2006, pp. 169-182
Canonical partitions of universal structures
C. Laflamme
,
N.W. Sauer
,
V. Vuksanovic
Combinatorica
26
(2), 2006, pp. 183-205
An inverse-Ackermann type lower bound for online minimum spanning tree verification
Seth Pettie
Combinatorica
26
(2), 2006, pp. 207-230
Coloring subgraphs of the Rado graph
N.W. Sauer
Combinatorica
26
(2), 2006, pp. 231-253
Network design via iterative rounding of setpair relaxations
Joseph Cheriyan
,
Santosh Vempala
,
Adrian Vetta
Combinatorica
26
(3), 2006, pp. 255-275
Mader's conjecture on extremely critical graphs
Matthias Kriesell
Combinatorica
26
(3), 2006, pp. 277-314
Supersaturation for Ramsey-Turán problems
Dhruv Mubayi
,
Vojtȇch Rödl
Combinatorica
26
(3), 2006, pp. 315-332
Extremal problems for transversals in graphs with bounded degree
Tibor Szabó
,
Gábor Tardos
Combinatorica
26
(3), 2006, pp. 333-351
Symplectic spaces and ear-decomposition of matroids
Balázs Szegedy
,
Christian Szegedy
Combinatorica
26
(3), 2006, pp. 353-377
Blocking sets of external lines to a conic in
PG(2,q), q
odd
Angela Aguglia
,
Gábor Korchmáros
Combinatorica
26
(4), 2006, pp. 379-394
Random subgraphs of finite graphs: III. The phase transition for the
n
-cube
Christian Borgs
,
Jennifer T. Chayes
,
Remco van der Hofstad
,
Gordon Slade
,
Joel Spencer
Combinatorica
26
(4), 2006, pp. 395-410
Expansion of product replacement graphs
Alexander Gamburd
,
Igor Pak
Combinatorica
26
(4), 2006, pp. 411-429
Independent sets in association schemes
C.D. Godsil
,
M.W. Newman
Combinatorica
26
(4), 2006, pp. 431-443
A weighted Erdŏs-Ginzburg-Ziv theorem
David J. Grynkiewicz
Combinatorica
26
(4), 2006, pp. 445-453
Seiten 1
2
>