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=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimal fixturing of frictionless assemblies: Complexity and Algorithms
D. Baraff
,
R. Mattikalli
,
P. Khosla
Algorithmica
19
, 1997, pp. 4-39
Planning for modular and hybrid fixtures
A.S. Wallack
,
J.F. Canny
Algorithmica
19
, 1997, pp. 40-60
Feasibility of design in stereolithography
B. Asberg
,
G. Blanco
,
P. Bose
,
J. Garcia-Lopez
,
M. Overmars
,
G. Toussaint
,
G. Wilfong
,
B. Zhu
Algorithmica
19
, 1997, pp. 61-83
Determining the castability of simple polyhedra
P. Bose
,
D. Bremner
,
M. van Kreveld
Algorithmica
19
, 1997, pp. 84-113
Visualization of three-dimensional Delaunay meshes
M.S. Karasick
,
D. Lieber
,
L.R. Nackman
,
V.T. Rajan
Algorithmica
19
, 1997, pp. 114-128
Coordinated manipulation of objects in a plane
D. Rus
Algorithmica
19
, 1997, pp. 129-147
Multiple translational containment - Part I: An approximate algorithm
K. Daniels
,
V.J. Milenkovic
Algorithmica
19
, 1997, pp. 148-182
Multiple translational containment - Part II: Exact algorithms
V. Milenkovic
Algorithmica
19
, 1997, pp. 183-218
Efficient perturbations for handling geometric degeneracies
I.Z. Emiris
,
J.F. Canny
,
R. Seidel
Algorithmica
19
, 1997, pp. 219-242
Reconstructing surfaces and functions on surfaces from unorganized three-dimensional data
C.L. Bajaj
,
F. Bernardini
,
G. Xu
Algorithmica
19
, 1997, pp. 243-261
Hexagonal models for channel routing
M.L. Brady
,
D.J. Brown
,
K.D. Powers
Algorithmica
19
, 1997, pp. 263-290
Parallel searching in generalized Monge arrays
A. Aggarwal
,
D. Kravets
,
J.K. Park
,
S. Sen
Algorithmica
19
, 1997, pp. 291-317
Expansion of linear Steiner trees
J.F. Weng
Algorithmica
19
, 1997, pp. 318-330
From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
R. Giegerich
,
S. Kurtz
Algorithmica
19
, 1997, pp. 331-353
Parallel algorithms for maximal acyclic sets
Z.-Z. Chen
,
X. He
Algorithmica
19
, 1997, pp. 354-367
Tree-based parallel algorithm design
G.L. Miller
,
S.-H. Teng
Algorithmica
19
, 1997, pp. 369-389
On implementing the push-relabel method for the maximum flow problem
B.V. Cherkassky
,
A.V. Goldberg
Algorithmica
19
, 1997, pp. 390-410
A pinwheel scheduler for three distinct numbers with a tight schedulability bound
Shun-Shii Lin
,
Kwei-Jay Lin
Algorithmica
19
, 1997, pp. 411-426
On triangulating planar graphs under the four-connectivity constraint
T. Biedl
,
G. Kant
,
M. Kaufmann
Algorithmica
19
, 1997, pp. 427-446
On the complexity of approximating Euclidean Traveling Salesman tours and minimum spanning trees
G. Das
,
S. Kapoor
,
M. Smid
Algorithmica
19
, 1997, pp. 447-460