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=Algorithmica AND Volume=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Denesting by bounded degree radicals
J. Blömer
Algorithmica
28
(1), 2000, pp. 2-15
A linear time algorithm for the arc disjoint Menger problem in planar directed graphs
U. Brandes
,
D. Wagner
Algorithmica
28
(1), 2000, pp. 16-36
Optimal adaptive broadcasting with a bounded fraction of faulty nodes
K. Diks
,
A. Pelc
Algorithmica
28
(1), 2000, pp. 37-50
Partitioning planar graphs with vertex costs: Algorithms and applications
H.N. Djidjev
Algorithmica
28
(1), 2000, pp. 51-75
Dynamically switching vertices in planar graphs
D. Frigioni
,
G.F. Italiano
Algorithmica
28
(1), 2000, pp. 76-103
Optimal reconstruction of graphs under the additive model
V. Grebinski
,
G. Kucherov
Algorithmica
28
(1), 2000, pp. 104-124
Fault-tolerant real-time scheduling
B. Kalyanasundaram
,
K. Pruhs
Algorithmica
28
(1), 2000, pp. 125-144
Approximating satisfiable satisfiability problems
L. Trevisan
Algorithmica
28
(1), 2000, pp. 145-172
Online randomized multiprocessor scheduling
S.S. Seiden
Algorithmica
28
, 2000, pp. 173-216
Parallel algorithms for partitioning sorted sets and related problems
D.Z. Chen
,
W. Chen
,
K. Wada
,
K. Kawaguchi
Algorithmica
28
, 2000, pp. 217-241
Finding the
k
shortest paths in parallel
E. Ruppert
Algorithmica
28
, 2000, pp. 242-254
Simple algorithms for the on-line multidimensional dictionary and related problems
T.F. Gonzalez
Algorithmica
28
, 2000, pp. 255-267
Fast spatial decomposition and closest pair computation for limited precision input
J.H. Reif
,
S.R. Tate
Algorithmica
28
, 2000, pp. 271-287
The temporal precedence problem
D. Ranjan
,
E. Pontelli
,
G. Gupta
,
L. Longpre
Algorithmica
28
, 2000, pp. 288-306
A unified approach to conic visibility
J. García-López
,
P.A. Ramos
Algorithmica
28
, 2000, pp. 307-322
Sorting by short block-moves
L.S. Heath
,
J.P.C. Vergara
Algorithmica
28
, 2000, pp. 323-352
Linear size binary space partitions for uncluttered scenes
M. de Berg
Algorithmica
28
, 2000, pp. 353-366
Improved algorithms for dynamic shortest paths
H.N. Djidjev
,
G.E. Pantziou
,
C.D. Zaroliagis
Algorithmica
28
, 2000, pp. 367-389
A faster one-dimensional topological compaction algorithm with jog insertion
H. Steven Chen
,
D.T. Lee
Algorithmica
28
, 2000, pp. 390-421
Approximation algorithms with bounded performance guarantees for the clustered Traveling Salesman problem
N. Guttman-Beck
,
R. Hassin
,
S. Khuller
,
B. Raghavachari
Algorithmica
28
, 2000, pp. 422-437
Improved routing and sorting on multibutterflies
B.M. Maggs
,
B. Vöcking
Algorithmica
28
, 2000, pp. 438-464