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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On nonlinear parametric search
D. Fernández-Baca
Algorithmica
30
(1), 2001, pp. 1-11
Optimal edge ranking of trees in linear time
T.W. Lam
,
F.L. Yue
Algorithmica
30
(1), 2001, pp. 12-33
A generalization of a lower bound technique due to Fredman and Saks
A.M. Ben-Amram
,
Z. Galil
Algorithmica
30
(1), 2001, pp. 34-66
Circular separability of polygons
J.-D. Boissonnat
,
J. Czyzowicz
,
O. Devillers
,
M. Yvinec
Algorithmica
30
(1), 2001, pp. 67-82
Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
D.J. Rosenkrantz
,
L. Yu
,
S.S. Ravi
Algorithmica
30
(1), 2001, pp. 83-100
Optimal search and one-way trading online algorithms
R. El-Yaniv
,
A. Fiat
,
R.M. Karp
,
G. Turpin
Algorithmica
30
(1), 2001, pp. 101-139
A one-step crust and skeleton extraction algorithm
C. Gold
,
J. Snoeyink
Algorithmica
30
(2), 2001, pp. 144-163
Efficient regular data structures and algorithms for dilation, location, and proximity poblems
A. Amir
,
A. Efrat
,
P. Indyk
,
H. Samet
Algorithmica
30
(2), 2001, pp. 164-187
Constraint-based processing of multiway spatial joins
D. Papadias
,
N. Mamoulis
,
Y. Theodoridis
Algorithmica
30
(2), 2001, pp. 188-215
Robust distance-based clustering with applications to spatial data mining
V. Estivill-Castro
,
M.E. Houle
Algorithmica
30
(2), 2001, pp. 216-242
Structural lines, TINs, and DEMs
J.J. Little
,
P. Shi
Algorithmica
30
(2), 2001, pp. 243-263
Right-triangulated irregular networks
W. Evans
,
D. Kirkpatrick
,
G. Townsend
Algorithmica
30
(2), 2001, pp. 264-286
An iterative displacement method for conflict resolution in map generalization
M. Lonergan
,
C.B. Jones
Algorithmica
30
(2), 2001, pp. 287-301
Autmated displacement for large numbers of discrete map objects
W.A. Mackaness
,
R.S. Purves
Algorithmica
30
(2), 2001, pp. 302-311
Contextual building typification in automated map generalization
N. Regnauld
Algorithmica
30
(2), 2001, pp. 312-333
Three rules suffice for good label placement
F. Wagner
,
A. Wolff
,
V. Kapoor
,
T. Strijk
Algorithmica
30
(2), 2001, pp. 334-349
On rooted node-connectivity problems
J. Cheriyan
,
T. Jordán
,
Z. Nutov
Algorithmica
30
(3), 2001, pp. 353-375
Random sampling of Euler tours
P. Tetali
,
S. Vempala
Algorithmica
30
(3), 2001, pp. 376-385
Polynomial time approximation schemes for some dense instances of
NP
-hard optimization problems
M. Karpinski
Algorithmica
30
(3), 2001, pp. 386-397
Best possible approximation algorithm for MAX SAT with cardinality constraint
M.I. Sviridenko
Algorithmica
30
(3), 2001, pp. 398-405
An approximation algorithm for circular arc colouring
V. Kumar
Algorithmica
30
(3), 2001, pp. 406-417
Sample spaces with small bias on neighborhoods and error-correcting communication protocols
M. Saks
,
S. Zhou
Algorithmica
30
(3), 2001, pp. 418-431
On the hardness of approximating spanners
G. Kortsarz
Algorithmica
30
(3), 2001, pp. 432-450
Approximation of geometric dispersion problems
C. Baur
,
S.P. Fekete
Algorithmica
30
(3), 2001, pp. 451-470
Improving an algorithm for approximate pattern matching
G. Navarro
,
R. Baeza-Yates
Algorithmica
30
(4), 2001, pp. 473-502
Seiten 1
2
>