Peter Eades, Sue Whitesides: The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard.
49-56
Sanguthevar Rajasekaran, Suneeta Ramaswami: Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems.
57-66
Jirí Matousek: On Geometric Optimization with Few Violated Constraints.
312-321
Michael T. Goodrich: Efficient Piecewise-Linear Function Approximation Using the Uniform Metric (Preliminary Version).
322-331
Mary Inaba, Naoki Katoh, Hiroshi Imai: Applications of Weighted Voronoi Diagrams and Randomization to Variance-Based k-Clustering (Extended Abstract).
332-339
Nina Amenta: Bounded Boxes, Hausdorff Distance, and a New Proof of an Interesting Helly-Type Theorem.
340-347
data released under the ODC-BY 1.0 license
