- The hunting of the bump: on maximizing statistical discrepancy, AgaPhiVen-SODA-06
- An $O(n\log n)$ algorithm for maximum $st$-flow in a directed planar graph, BorKle-SODA-06
- Many distances in planar graphs, Cab-SODA-06
- A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries, Cha-SODA-06
- Tightening non-simple paths and cycles on surfaces, ColEri-SODA-06
- Measure and conquer: a simple $O(n^{0.288n})$ independent set algorithm, FomGraKra-SODA-06
- The rainbow skip graph: a fault-tolerant constant-degree distributed data structure, GooNelSun-SODA-06