# Proc. 10th Symp. Discrete Algorithms

- Kinetic collision detection between simple polygons, BasEriGui-SODA-99
- Efficient algorithms for Petersen's matching theorem, BieBosDem-SODA-99
- Some graphic uses of an even number of odd nodes, CamEdw-SODA-99
- Approximate minimum weight Steiner triangulation in three dimensions, CheDey-SODA-99
- Folding and one straight cut suffice, DemDemLub-SODA-99
- A simple provable algorithm for curve reconstruction, DeyKum-SODA-99
- Clustering in large graphs and matrices, DriFriKan-SODA-99
- Incremental and decremental maintenance of planar width, Epp-SODA-99
- Shortest paths in an arrangement with $k$ line orientations, EppHar-SODA-99
- Fully dynamic algorithms for chordal graphs, Iba-SODA-99
- Parametric polymatroid optimization and its geometric applications, KatTamTok-SODA-99
- Combinatorics helps for hexahedral mesh generation in CAD, Mue-SODA-99