Journal: Algorithmica

Volume 5, Issue 3

295 -- 311Joseph C. Culberson, J. Ian Munro. Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees
313 -- 323Esko Ukkonen. A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings
325 -- 340Friedemann Mattern. Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo Algorithms
341 -- 352Ming-Tat Ko, Richard C. T. Lee, Jyun-Sheng Chang. An Optimal Approximation Algorithm for the Rectilinear m-Center Problem
353 -- 382Bruce Randall Donald. The Complexity of Planar Compliant Motion Planning Under Uncertainty
383 -- 406Michael M. Wu, Michael C. Loui. An Efficient Distributed Algorithm for Maximum Matching in General Graphs
407 -- 419Clyde L. Monma, Mike Paterson, Subhash Suri, F. Frances Yao. Computing Euclidean Maximum Spanning Trees
421 -- 457David P. Dobkin, Diane L. Souvaine. Computational Geometry in a Curved World
459 -- 466Bonnie Berger, John Rompel. A Better Performance Guarantee for Approximate Graph Coloring