Abstract is missing.
- Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with ApplicationsEfi Fogel, Dan Halperin. 3-15 [doi]
- An Experimental Study of Point Location in General Planar ArrangementsIdit Haran, Dan Halperin. 16-25 [doi]
- Summarizing Spatial Data Streams Using ClusterHullsJohn Hershberger, Nisheeth Shrivastava, Subhash Suri. 26-40 [doi]
- Distance-Sensitive Bloom FiltersAdam Kirsch, Michael Mitzenmacher. 41-50 [doi]
- An Experimental Study of Old and New Depth MeasuresJohn Hugg, Eynat Rafalin, Kathryn Seyboth, Diane L. Souvaine. 51-64 [doi]
- Keep Your Friends Close and Your Enemies Closer: The Art of Proximity SearchingDavid M. Mount. 65 [doi]
- Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under UncertaintyGrzegorz Malewicz. 66-74 [doi]
- Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin CoverEyjólfur Ingi Ásgeirsson, Cliff Stein. 75-85 [doi]
- Data Reduction, Exact, and Heuristic Algorithms for Clique CoverJens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier. 86-94 [doi]
- Fast Reconfiguration of Data Placement in Parallel DisksSrinivas R. Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik. 95-107 [doi]
- Force-Directed Approaches to Sensor LocalizationAlon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, Cesim Erten. 108-118 [doi]
- Compact Routing on Power Law Graphs with Additive StretchArthur Brady, Lenore J. Cowen. 119-128 [doi]
- Reach for A*: Efficient Point-to-Point Shortest Path AlgorithmsAndrew V. Goldberg, Haim Kaplan, Renato F. Werneck. 129-143 [doi]
- Distributed Routing in Small-World NetworksOskar Sandberg. 144-155 [doi]
- Engineering Multi-Level Overlay Graphs for Shortest-Path QueriesMartin Holzer, Frank Schulz, Dorothea Wagner. 156-170 [doi]
- Optimal Incremental SortingRodrigo Paredes, Gonzalo Navarro. 171-182 [doi]