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=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Upper and lower bounds for selection on the mesh
A. Condon
,
L. Narayanan
Algorithmica
20
(1), 1998Papadopoulou, E. and D.T. Lee, pp. 1-30
Average-case analysis of dynamic graph algorithms
D. Alberts
,
M.R. Henzinger
Algorithmica
20
(1), 1998, pp. 31-60
Minkowski-type theorems and least-squares clustering
F. Aurenhammer
,
F. Hoffmann
,
B. Aronov
Algorithmica
20
(1), 1998, pp. 61-76
On learning decision trees with large output domains
N.H. Bshouty
,
C. Tamon
,
D.K. Wilson
Algorithmica
20
(1), 1998, pp. 77-100
Minimizing mean flow time with error constraint
J.Y.-T. Leung
,
T.W. Tam
,
C.S. Wong
,
G.H. Young
Algorithmica
20
(1), 1998, pp. 101-118
An algorithm for straight-line drawing of planar graphs
D. Harel
,
M. Sardas
Algorithmica
20
(2), 1998, pp. 119-135
Efficient randomized algorithms for the repeated median line estimator
J. Matous̑ek
,
D.M. Mount
,
N.S. Netanyahu
Algorithmica
20
(2), 1998, pp. 136-150
Approximating minimum feedback sets and multicuts in directed graphs
G. Even
,
J. (Seffi) Naor
,
B. Schieber
,
M. Sudan
Algorithmica
20
(2), 1998, pp. 151-174
A unified analysis of paging and caching
E. Torng
Algorithmica
20
(2), 1998, pp. 175-200
Efficient algorithms for computing a complete visibility region in three-dimensional space
Seoung Kim Dae
,
Kwan-Hee Yoo
,
Kyung-Yong Chwa
,
Sung Yong Shin
Algorithmica
20
(2), 1998, pp. 201-225
Linear-time algorithms for finding the shadow volumes from a convex area light source
Yoo Kwan-Hee
,
Dae Seoung Kim
,
Sung Yong Shin
,
Kyung-Yong Chwa
Algorithmica
20
(3), 1998, pp. 227-241
Maintaining the classes of 4-edge-connectivity in a graph on-line
Ye. Dinitz
,
J. Westbrook
Algorithmica
20
(3), 1998, pp. 242-276
On coloring unit disk graphs
A. Gräf
,
M. Stumpf
,
G. Weiss̈enfels
Algorithmica
20
(3), 1998, pp. 277-293
Minimum dominating sets of intervals on lines
S.-W. Cheng
,
M. Kaminski
,
S. Zaks
Algorithmica
20
(3), 1998, pp. 294-308
Subcubic cost algorithms for the all pairs shortest path problem
T. Takaoka
Algorithmica
20
(3), 1998, pp. 309-318
A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
E. Papadopoulou
,
D.T. Lee
Algorithmica
20
(4), 1998, pp. 319-352
Two-dimensional prefix string matching and covering on square matrices
M. Crochemore
,
C.S. Iliopoulos
,
M. Korda
Algorithmica
20
(4), 1998, pp. 353-373
Approximation algorithms for connected dominating sets
S. Guha
,
S. Khuller
Algorithmica
20
(4), 1998, pp. 374-387
String matching in Lempel-Ziv compressed strings
M. Farach
,
M. Thorup
Algorithmica
20
(4), 1998, pp. 388-404