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