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=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Equitable coloring of sparse planar graphs
Ruo Luo
,
Jean-Sébastien Sereni
,
D. Christopher Stephens
,
Gexin Yu
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1572-1583
Ends and vertices of small degree in infinite minimally
k
-(edge)-connected graphs
Maya Stein
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1584-1596
The balanced decomposition number and vertex connectivity
Shinya Fujita
,
Henry Liu
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1597-1616
On the number of two-dimensional threshold functions
Max A. Alekseyev
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1617-1631
Thomassen's choosability argument revisited
David R. Wood
,
Svante Linusson
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1632-1637
Neighbor systems and the greedy algorithm
David Hartvigsen
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1638-1661
A more relaxed model for graph-based data clustering:
s
-Plex Cluster Editing
Jiong Guo
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1662-1683
On additive doubling and energy
Nets Hawk Katz
,
Paul Koester
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1684-1693
Flooding time of edge-Markovian evolving graphs
Andrea E.F. Clementi
,
Claudio Macci
,
Angelo Monti
,
Francesco Pasquale
,
Riccardo Silvestri
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1694-1712
Obnoxious centers in graphs
Sergio Cabello
,
Günter Rote
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1713-1730
Bridges in highly connected graphs
Paul Wollan
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1731-1741
A construction of infinite sets of intertwines for pairs of matroids
Joseph E. Bonin
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1742-1752
Bessel polynomials and the partial sums of the exponential series
Ömer Eg̑eciog̑lu
SIAM Journal on Discrete Mathematics
24
(4), 2010, pp. 1753-1768
Paths with no small angles
Imre Bárány
,
Attila Pór
,
Pavel Valtr
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1655-1666
Approximate nonlinear optimization over weighted independence systems
Jon Lee
,
Shmuel Onn
,
Robert Weismantel
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1667-1681
Finding planted partitions in random graphs with general degree distributions
Amin Coja-Oghlan
,
André Lanka
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1682-1714
Probabilistic analysis of a motif discovery algorithm for multiple sequences
Bin Fu
,
Ming-Yang Kao
,
Lusheng Wang
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1715-1737
Multiple random walks in random regular graphs
Colin Cooper
,
Alan Frieze
,
Tomasz Radzik
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1738-1761
The fractional chromatic number of graphs of maximum degree at most three
Hamed Hatami
,
Xuding Zhu
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1762-1775
Locating errors using ELAs, covering arrays, and adaptive testing algorithms
Conrado Martínez
,
Lucia Moura
,
Daniel Panario
,
Brett Stevens
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1776-1799
A new intersection model and improved algorithms for tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1800-1813
The surviving rate of a graph for the firefighter problem
Cai Leizhen
,
Wang Weifan
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1814-1826
A tight upper bound on the probabilistic embedding of series-parallel graphs
Yuval Emek
,
David Peleg
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1827-1841
Upward spirality and upward planarity testing
Walter Didimo
,
Francesco Giordano
,
Giuseppe Liotta
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1842-1899
The ultimate categorical independence ratio of complete multipartite graphs
Ágnes Tóth
SIAM Journal on Discrete Mathematics
23
(4), 2009-2010, pp. 1900-1904
Seiten
<
1
2
3
4
5
6
>