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=SIAM J. Disc.~Math. AND YEAR=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithms and analysis for secretary problems and generalizations
Miklos Ajtai
,
Nimrod Megiddo
,
Orli Waarts
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 1-27
Labeling products of complete graphs with a condition at distance two
John P. Georges
,
David W. Mauro
,
Melanie I. Stein
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 28-35
Sufficient conditions for two tree reconstruction techniques to succeed on sufficiently long sequences
Mike Steel
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 36-48
Compact representations of cuts
David Hartvigsen
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 49-66
Better approximation guarantees for job-shop scheduling
Leslie Ann Goldberg
,
Mike Paterson
,
Aravind Srinivasan
,
Elizabeth Sweedyk
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 67-92
Enumeration of equicolorable trees
Nicholas Pippenger
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 93-115
A note on a question of C.D. Savage
Michael Naatz
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 116-120
Cyclic chromatic number of 3-connected plane graphs
Hikoe Enomoto
,
Mirko Horn̑ák
,
Stanislav Jendrol'
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 121-137
Approximate edge splitting
Michel X. Goemans
SIAM Journal on Discrete Mathematics
14
(1), 2000-2001, pp. 138-141
Extremal properties for dissections of convex 3-polytopes
Jesús A. de Loera
,
Francisco Santos
,
Fumihiko Takeuchi
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 143-161
On the distribution of Diffie-Hellman triples with sparse exponents
John B. Friedlander
,
Igor E. Shparlinski
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 162-169
Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph
J. Cheriyan
,
A. Seb\Ho
,
Z. Szigeti
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 170-180
Compact representations of the intersection structure of families of finite sets
János Körner
,
Angelo Monti
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 181-192
Sorting strings by reversals and by transpositions
David A. Christie
,
Robert W. Irving
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 193-206
The wakeup problem in synchronous broadcast systems
Leszek Ga̧sieniec
,
Andrzej Pelc
,
David Peleg
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 207-222
A new property and a faster algorithm for baseball elimination
Kevin D. Wayne
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 223-229
A lower bound for Heilbronn's triangle problem in
d
dimensions
Gill Barequet
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 230-236
A note on iterating an
\alpha
-ary Gray code
Chi-Jen Lu
,
Shi-Chun Tsai
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 237-239
The number of irreducible polynomials and Lyndon words with given trace
F. Ruskey
,
C.R. Miers
,
J. Sawada
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 240-245
A 0.5-approximation algorithm for MAX DICUT with given sizes of parts
Alexander Ageev
,
Refael Hassin
,
Maxim Sviridenko
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 246-255
Optimal
(9v, 4, 1)
optical orthogonal codes
Ryoh Fuji-Hara
,
Ying Miao
,
Jianxing Yin
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 256-266
On the optimality of general lower bounds for broadcasting and gossiping
Michele Flammini
,
Stéphane Pérennés
SIAM Journal on Discrete Mathematics
14
(2), 2001, pp. 267-282
Construction of Ferrero pairs of all possible orders
Tim Boykett
SIAM Journal on Discrete Mathematics
14
(3), 2001, pp. 283-285
Monochromatic partitions of complete uniform hypergraphs
Krzysztof Bryś
,
Zbigniew Lonc
SIAM Journal on Discrete Mathematics
14
(3), 2001, pp. 286-290
An efficient algorithm for the ring loading problem with integer demand splitting
Young-Soo Myung
SIAM Journal on Discrete Mathematics
14
(3), 2001, pp. 291-298
Seiten 1
2
>