# Proc. 13th Symp. Discrete Algorithms

- Closest-point problems simplified on the RAM, Cha-SODA-02-cp
- Semi-online maintenance of geometric optima and measures, Cha-SODA-02-so
- Quality meshing with weighted Delaunay refinement, CheDey-SODA-02
- Motorcycle graphs and straight skeletons, CheVig-SODA-02
- A sub-quadratic sequence alignment algorithm for unrestricted cost matrices, CroLanZiv-SODA-02
- An algorithm for counting maximum weighted independent sets and its applications, DahJoh-SODA-02
- Shape dimension and approximation from samples, DeyGieGos-SODA-02
- Light spanners and approximate TSP in graphs with forbidden minors, GriSis-SODA-02
- Symmetric drawings of triconnected planar graphs, HonMcKEad-SODA-02
- Labeling schemes for flow and connectivity, KatKatKor-SODA-02
- Computing shortest paths with comparisons and additions, PetRam-SODA-02
- Algorithms for quantified Boolean formulas, Wil-SODA-02