# Proc. 18th Symp. Discrete Algorithms

- Region-fault tolerant geometric spanners, AbaBerFar-SODA-07
- Compressing rectilinear pictures and minimizing access control lists, AppCalJoh-SODA-07
- Approximation algorithms for embedding general metrics into trees, BadIndSid-SODA-07
- Cheap labor can be expensive, CheKar-SODA-07
- Approximation algorithms via contraction decomposition, DemHajMoh-SODA-07
- Squarepants in a tree: sum of subtree clustering and hyperbolic pants decomposition, Epp-SODA-07
- Digraph measures: Kelly decompositions, games, and orderings, HunKre-SODA-07
- Geometric and topological guarantees for the WRAP reconstruction algorithm, RamSad-SODA-07
- On the $k$-simple shortest paths problem in weighted directed graphs, Rod-SODA-07
- On bounded leg shortest paths problems, RodSeg-SODA-07
- Faster dynamic matchings and vertex connectivity, San-SODA-07