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.

• Pankaj K. Agarwal, Boris Aronov, and Micha Sharir. Computing envelopes in four dimensions with applications. SIAM Journal on Computing, 26(6):1714-1732, December 1997.

• Pankaj K. Agarwal, Boris Aronov, and Micha Sharir. Line traversals of balls and smallest enclosing cylinders in three dimensions. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 483-492, New Orleans, Louisiana, 5-7 January 1997.

• Pankaj K. Agarwal and Sandeep Sen. Selection in monotone matrices and computing kth nearest neighbors. Journal of Algorithms, 20(3):581-601, May 1996.

• Nina Amenta, Marshall Bern, and David Eppstein. Optimal point placement for mesh smoothing. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 528-537, New Orleans, Louisiana, 5-7 January 1997.

• Sergei N. Bespamyatnikh. An efficient algorithm for the three-dimensional diameter problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 137-146, San Francisco, California, 25-27 January 1998.

• Yuval Caspi and Eliezer Dekel. Edge coloring series parallel graphs. Journal of Algorithms, 18(2):296-321, March 1995.

• Timothy M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming. Journal of Algorithms, 27(1):147-166, April 1998.

• 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.

• Edith Cohen and Nimrod Megiddo. Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Journal of the ACM, 40(4):791-830, September 1993.

• Kay U. Drangmeister, Sven O. Krumke, Madhav V. Marathe, Hartmut Noltemeier, and S. S. Ravi. Modifying edges of a network to obtain short subgraphs. Theoretical Computer Science, 203(1):91-121, 6 August 1998.

• 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.

• L. Fleischer. Faster algorithms for the quickest transshipment problem with zero transit times. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 147-156, San Francisco, California, 25-27 January 1998.

• Alexander V. Karzanov and S. Thomas McCormick. Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM Journal on Computing, 26(4):1245-1275, August 1997.

• Owen Kaser. Optimal Height Reduction Problems for Tree-Structured Hierarchies Nordic Journal of Computing, 4(4):357, Winter 1997.

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

• S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, and D. J. Rosenkrantz. Compact location problems. Theoretical Computer Science, 181(2):379-404, 30 July 1997.

• Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt III. Bicriteria network design problems. Journal of Algorithms, 28(1):142-171, July 1998.

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

• Ji\v{r}í Matou\v{s}ek. On enclosing k points by a circle. Information Processing Letters, 53(4):217-221, 24 February 1995.

• 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.

• Shai Mohaban and Micha Sharir. Ray shooting amidst spheres in three dimensions and related problems. SIAM Journal on Computing, 26(3):654-674, June 1997.

• 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.

• Marco Pellegrini. Repetitive hidden surface removal for polyhedra. Journal of Algorithms, 21(1):80-101, July 1996.

• Süleyman Cenk \d{S}ahinalp and Uzi Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm (extended abstract). In 37th Annual Symposium on Foundations of Computer Science, pages 320-328, Burlington, Vermont, 14-16 October 1996. IEEE.

• 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.

• Kasturi R. Varadarajan and Pankaj K. Agarwal. Linear approximation of simple objects. Information Processing Letters, 62(2):89-94, 28 April 1997.

Shortcuts: