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=SIAM J. Disc.~Math. AND YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved algorithm for the half-disjoint paths problem
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1322-1330
Approximating width parameters of hypergraphs with excluded minors
Fedor V. Fomin
,
Petr A. Golovach
,
Dimitrios M. Thilikos
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1331-1348
Laplacians for flow networks
Joshua A. Taylor
,
Franz S. Hover
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1349-1364
Counting stars and other small subgraphs in sublinear-time
Mira Gonen
,
Dana Ron
,
Yuval Shavitt
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1365-1411
Permutations as product of parallel transpositions
Chase Albert
,
Chi-Kwong Li
,
Gilbert Strang
,
Gexin Yu
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1412-1417
Cutwidth of split graphs and threshold graphs
Pinar Heggernes
,
Daniel Lokshtanov
,
Rodica Mihai
,
Charis Papadopoulos
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1418-1437
A bound for the cops and robbers problem
Alex Scott
,
Benny Sudakov
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1438-1442
The domination number of grids
Daniel Gonçalves
,
Alexandre Pinlou
,
Michaël Rao
,
Stéphan Thomassé
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1443-1453
Fractional colorings of cubic graphs with large girth
Frantis̑ek Kardos̑
,
Daniel Král'
,
Jan Volec
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1454-1476
A note on bipartite graph tiling
Andrzej Czygrinow
,
Louis DeBiasio
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1477-1489
Edge-partitioning regular graphs for ring traffic grooming with a priori placement of the ADMs
Xavier Muñoz
,
Zhentao Li
,
Ignasi Sau
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1490-1505
Computing geodesic distances in tree space
Megan Owen
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1506-1529
Labeled ballot paths and the Springer numbers
William Y.C. Chen
,
Neil J.Y. Fan
,
Jeffrey Y.T. Jia
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1530-1546
A complete generalization of Clatworthy group divisible designs
Fei Gao
,
Gennian Ge
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1547-1561
Sublinear time algorithms
Ronitt Rubinfeld
,
Asaf Shapira
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1562-1588
Uniqueness in discrete tomography: Three remarks and a corollary
Peter Gritzmann
,
Barbara Langfeld
,
Markus Wiegelmann
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1589-1599
Finding cycles with topological properties in embedded graphs
Sergio Cabello
,
Éric Colin de Verdière
,
Francis Lazarus
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1600-1614
Asymptotic study of subcritical graph classes
Michael Drmota
,
Éric Fusy
,
Mihyun Kang
,
Veronika Kraus
,
Juanjo Rué
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1615-1651
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Paul Bonsma
,
Florian Zickfeld
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1652-1666
Stronger bounds on Braess's paradox and the maximum latency of selfish routing
Henry Lin
,
Tim Roughgarden
,
Éva Tardos
,
Asher Walkover
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1667-1686
Boxicity and poset dimension
Abhijin Adiga
,
Diptendu Bhowmick
,
L. Sunil Chandran
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1687-1698
Bounds on
s
-distance sets with strength
t
Hiroshi Nozaki
,
Sho Suda
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1699-1713
A note on the maximum number of edges of nonflowerable coin graphs
Geir Agnarsson
,
Jill Bigley Dunham
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1714-1721
A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
Sagi Snir
,
Raphael Yuster
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1722-1736
On the 2-resonance of fullerenes
Tomás̑ Kaiser
,
Matȇj Stehlík
,
Riste S̑krekovski
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1737-1745
Seiten
<
1
2
3
4
5
>