Algorithmica, Volume 20, 1998

Volume 20, Number 1, January 1998

• Anne Condon, Lata Narayanan: Upper and Lower Bounds for Selection in the Mesh. 1-30 BibTeX
• David Alberts, Monika Rauch Henzinger: Average-Case Analysis of Dynamic Graph Algorithms. 31-60 BibTeX
• Franz Aurenhammer, F. Hoffmann, Boris Aronov: Minkowski-Type Theorems and Least-Squares Clustering. 61-76 BibTeX
• Nader H. Bshouty, Christino Tamon, David K. Wilson: On Learning Decision Trees with Large Output Domains. 77-100 BibTeX
• Joseph Y.-T. Leung, Tommy W. Tam, C. S. Wong, Gilbert H. Young: Minimizing Mean Flow Time with Error Constraint. 101-118 BibTeX

Volume 20, Number 2, February 1998

• David Harel, Meir Sardas: An Algorithm for Straight-Line Drawing of Planar Graphs. 119-135 BibTeX
• Jirí Matousek, David M. Mount, Nathan S. Netanyahu: Efficient Randomized Algorithms for the Repeated Median Line Estimator. 136-150 BibTeX
• Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan: Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. 151-174 BibTeX
• Eric Torng: A Unified Analysis of Paging and Caching. 175-200 BibTeX
• Dae Seoung Kim, Kwan-Hee Yoo, Kyung-Yong Chwa, Sung Yong Shin: Efficient Algorithms for Computing a Complete Visibility Region in Three-Dimensional Space. 201-225 BibTeX

Volume 20, Number 3, March 1998

• Kwan-Hee Yoo, Dae Seoung Kim, Sung Yong Shin, Kyung-Yong Chwa: Linear-Time Algorithms for Finding the Shadow Volumes from a Convex Area Light Source. 227-241 BibTeX
• Yefim Dinitz, Jeffery Westbrook: Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line. 242-276 BibTeX
• A. Gräf, M. Stumpf, Gerhard Weißenfels: On Coloring Unit Disk Graphs. 277-293 BibTeX
• Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks: Minimum Dominating Sets of Intervals on Lines. 294-308 BibTeX
• Tadao Takaoka: Subcubic Cost Algorithms for the All Pairs Shortest Path Problem. 309-318 BibTeX

Volume 20, Number 4, April 1998

• Evanthia Papadopoulou, D. T. Lee: A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains. 319-352 BibTeX
• Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda: Two-Dimensional Prefix String Matching and Covering on Square Matrices. 353-373 BibTeX
• Sudipto Guha, Samir Khuller:
  Approximation Algorithms for Connected Dominating Sets. 374-387
  Electronic Edition (link) BibTeX
• Martin Farach, Mikkel Thorup: String Matching in Lempel-Ziv Compressed Strings. 388-404 BibTeX