Journal of the ACM Bibliography

Selected papers that cite this one

• Richa Agarwala and David Fernández-Baca. Weighted multidimensional search and its application to convex optimization. SIAM Journal on Computing, 25(1):83-99, February 1996.

• Timothy M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 464-472, New Orleans, Louisiana, 5-7 January 1997.

• Bernard Chazelle. Computational geometry: A restrospective. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 75-94, Montréal, Québec, Canada, 23-25 May 1994.

• Christian A. Duncan, Michael T. Goodrich, and Edgar A. Ramos. Efficient approximation and optimization algorithms for computational metrology. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 121-130, New Orleans, Louisiana, 5-7 January 1997.

• David Eppstein. Faster construction of planar two-centers. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 131-138, New Orleans, Louisiana, 5-7 January 1997.

• David Fernández-Baca and Giora Slutzki. Linear-time algorithms for parametric minimum spanning tree problems on planar graphs. Theoretical Computer Science, 181(1):57-74, 15 July 1997.

• David Fernández-Baca and Giora Slutzki. Optimal parametric search on graphs of bounded tree-width. Journal of Algorithms, 22(2):212-240, February 1997.

• D. Fernàndez-Baca, G. Slutzki and D. Eppstein. Using Sparsification for Parametric Minimum Spanning Tree Problems Nordic Journal of Computing, 3(4):352-366, Winter 1996.

• Matthew J. Katz and Micha Sharir. An expander-based approach to geometric optimization. SIAM Journal on Computing, 26(5):1384-1408, October 1997.

• Ji\v{r}í Matou\v{s}ek. Derandomization in computational geometry. Journal of Algorithms, 20(3):545-580, May 1996.

• J. Matou\v{s}ek, D. M. Mount, and N. S. Netanyahu. Efficient randomized algorithms for the repeated median line estimator. Algorithmica, 20(2):136-150, February 1998.

• Asish Mukhopadhyay, Alok Agrawal, and Ravi Mohan Hosabettu. On the Ordinary Line Problem in Computational Geometry Nordic Journal of Computing, 4(4):330, Winter 1997.

• Clark F. Olson. An approximation algorithm for least median of squares regression. Information Processing Letters, 63(5):237-241, 15 September 1997.

• Marco Pellegrini. On collision-free placements of simplices and the closest pair of lines in 3-space. SIAM Journal on Computing, 23(1):133-153, February 1994.

• Baruch Schieber. Computing a minimum weight k-link path in graphs with the concave Monge property. Journal of Algorithms, 29(2):204-222, November 1998.

Shortcuts: