- An empirical study of dynamic graph algorithms, AlbCatIta-SODA-96
- Optimal placement of convex polygons to maximize point containment, DicSch-SODA-96
- Fully dynamic output bounded single source shortest path problem, FriMarNan-SODA-96
- Fixed-dimensional parallel linear programming via relative epsilon-approximation, Goo-SODA-96
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, HenKinWar-SODA-96
- On certificates and lookahead in dynamic graph problems, KhaMotWil-SODA-96
- Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric $k$-MST problem, Mit-SODA-96