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=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding effective ``force targets'' for two-dimensional, multifinger frictional grips
Jacob T. Schwartz
,
Micha Sharir
Algorithmica
8
(1), 1992, pp. 1-20
Optimal routing algorithms for mesh-connected processor arrays
Sanguthevar Rajasekaran
,
Thanasis Tsantilas
Algorithmica
8
(1), 1992, pp. 21-38
Linear-time border-tracing algorithms for quadtrees
Robert E. Webber
,
Hanan Samet
Algorithmica
8
(1), 1992, pp. 39-54
L_1
shortest paths among polygonal obstacles in the plane
Joseph S.B. Mitchell
Algorithmica
8
(1), 1992, pp. 55-88
Path-matching problems
Sun Wu
,
Udi Manber
Algorithmica
8
, 1992, pp. 89-101
A bounded approximation for the minimum cost 2-sat problem
Dan Gusfield
,
Leonard Pitt
Algorithmica
8
, 1992, pp. 103-117
Line-segment intersection reporting in parallel
Christine Rüb
Algorithmica
8
, 1992, pp. 119-144
Polynomial-time primal simplex algorithms for the minimum cost network flow problem
Donald Goldfarb
,
Jianxiu Hao
Algorithmica
8
, 1992, pp. 145-160
A geometric view of parametric linear programming
Ilan Adler
,
Renato D.C. Monteiro
Algorithmica
8
, 1992, pp. 161-176
Solving the Euclidean bottleneck matching problem by
k
- relative neighborhood graphs
M.S. Chang
,
C.Y. Tang
,
R.C.T. Lee
Algorithmica
8
, 1992, pp. 177-194
An efficient algorithm for one-step planar compliant motion planning with uncertainty
Amy J. Briggs
Algorithmica
8
, 1992, pp. 195-208
On the parallel-decomposability of geometric problems
Mikhail J. Atallah
,
Jyh-Jong Tsay
Algorithmica
8
, 1992, pp. 209-231
Maximum concurrent flows and minimum cuts
C.K. Cheng
,
T.C. Hu
Algorithmica
8
, 1992, pp. 233-249
There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees
Christos Levcopoulos
,
Andrzej Lingas
Algorithmica
8
, 1992, pp. 251-256
Output-sensitive generation of the perspective view of isothetic parallelepipeds
Franco P. Preparata
,
Jeffrey Scott Vitter
,
Mariette Yvinec
Algorithmica
8
, 1992, pp. 257-283
Optimal parallel detection of squares in strings
Alberto Apostolico
Algorithmica
8
, 1992, pp. 285-319
Probing a scene on nonconvex polyhedra
J.D. Boissonnat
,
M. Yvinec
Algorithmica
8
, 1992, pp. 321-342
Constructing strongly convex hulls using exact or rounded arithmetic
Zhenyu Li
,
Victor Milenkovic
Algorithmica
8
, 1992, pp. 345-364
Simultaneous inner and outer approximation of shapes
Rudolf Fleischer
,
Kurt Mehlhorn
,
Günter Rote
,
Emo Welzl
,
Chee Yap
Algorithmica
8
, 1992, pp. 365-389
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Helmut Alt
,
Rudolf Fleischer
,
Michael Kaufmann
,
Kurt Mehlhorn
,
Stefan Näher
,
Stefan Schirra
,
Christian Uhrig
Algorithmica
8
, 1992, pp. 391-406
Quasi-optimal upper bounds for simplex range searching and new zone theormems
Bernard Chazelle
,
Micha Sharir
,
Emo Welzl
Algorithmica
8
, 1992, pp. 407-429
Minimum-link paths among obstacles in the plane
Joseph S.B. Mitchell
,
Günter Rote
,
Gerhard Woeginger
Algorithmica
8
, 1992, pp. 431-459
Parallel methods for visibility and shortest-path problems in simple polygons
Michael T. Goodrich
,
Steven B. Shauck
,
Sumanta Guha
Algorithmica
8
, 1992, pp. 461-486