| 2006 | An Experimental Study of Old and New Depth Measures. John Hugg, Eynat Rafalin, Kathryn Seyboth, Diane L. Souvaine |
| 2006 | An Experimental Study of Point Location in General Planar Arrangements. Idit Haran, Dan Halperin |
| 2006 | Compact Routing on Power Law Graphs with Additive Stretch. Arthur Brady, Lenore J. Cowen |
| 2006 | Data Reduction, Exact, and Heuristic Algorithms for Clique Cover. Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier |
| 2006 | Distance-Sensitive Bloom Filters. Adam Kirsch, Michael Mitzenmacher |
| 2006 | Distributed Routing in Small-World Networks. Oskar Sandberg |
| 2006 | Engineering Multi-Level Overlay Graphs for Shortest-Path Queries. Martin Holzer, Frank Schulz, Dorothea Wagner |
| 2006 | Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications. Efi Fogel, Dan Halperin |
| 2006 | Fast Reconfiguration of Data Placement in Parallel Disks. Srinivas R. Kashyap, Samir Khuller, Yung-Chun (Justin) Wan, Leana Golubchik |
| 2006 | Force-Directed Approaches to Sensor Localization. Alon Efrat, David Forrester, Anand Iyer, Stephen G. Kobourov, Cesim Erten |
| 2006 | Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty. Grzegorz Malewicz |
| 2006 | Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. David M. Mount |
| 2006 | Optimal Incremental Sorting. Rodrigo Paredes, Gonzalo Navarro |
| 2006 | Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments, ALENEX 2006, Miami, Florida, USA, January 21, 2006 Rajeev Raman, Matthias F. Stallmann |
| 2006 | Reach for A*: Efficient Point-to-Point Shortest Path Algorithms. Andrew V. Goldberg, Haim Kaplan, Renato F. Werneck |
| 2006 | Summarizing Spatial Data Streams Using ClusterHulls. John Hershberger, Nisheeth Shrivastava, Subhash Suri |
| 2006 | Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover. Eyjólfur Ingi Ásgeirsson, Cliff Stein |