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
[1]
Hilfe
Suche: Journal=Combinatorica AND Volume=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Oriented matroids and Ky Fan's theorem
Rade T. Z̑ivaljević
Combinatorica
30
(4), 2010, pp. 471-484
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Matthew Andrews
,
Julia Chuzhoy
,
Venkatesan Guruswami
,
Sanjeev Khanna
,
Kunal Talwar
,
Lisa Zhang
Combinatorica
30
(5), 2010, pp. 485-520
Every rayless graph has an unfriendly partition
Henning Bruhn
,
Reinhard Diestel
,
Agelos Georgakopoulos
,
Philipp Sprüssel
Combinatorica
30
(5), 2010, pp. 521-532
Approximation algorithms via contraction decomposition
Erik D. Demaine
,
MohammadTaghi Hajiaghayi
,
Bojan Mohar
Combinatorica
30
(5), 2010, pp. 533-552
On the limit of large girth graph sequences
Gábor Elek
Combinatorica
30
(5), 2010, pp. 553-563
Non-separating even cycles in highly connected graphs
Shinya Fujita
,
Ken-ichi Kawarabayashi
Combinatorica
30
(5), 2010, pp. 565-580
Maximum gradient embeddings and monotone clustering
Manor Mendel
,
Assaf Naor
Combinatorica
30
(5), 2010, pp. 581-615
The generalized almost resolvable cycle system problem
Peter Adams
,
Elizabeth J. Billington
,
D.G. Hoffman
,
C.C. Lindner
Combinatorica
30
(6), 2010, pp. 617-625
On properties of random dissections and triangulations
Nicla Bernasconi
,
Konstantinos Panagiotou
,
Angelika Steger
Combinatorica
30
(6), 2010, pp. 627-654
Asymptotic enumeration of integer matrices with large equal row and column sums
E. Rodney Canfield
,
Brendan D. McKay
Combinatorica
30
(6), 2010, pp. 655-680
The homology of a locally finite graph with ends
Reinhard Diestel
,
Philipp Sprüssel
Combinatorica
30
(6), 2010, pp. 681-714
Algorithms for finding an induced cycle in planar graphs
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Combinatorica
30
(6), 2010, pp. 715-734
An asymptotic bound for the complexity of monotone graph properties
Torsten Korneffel
,
Eberhard Triesch
Combinatorica
30
(6), 2010, pp. 735-743
Seiten
<
1
2