Proc. 16th Symp. Discrete Algorithms
- On levels in arrangements of surfaces in three dimensions, Cha-SODA-05a
- Finding the shortest bottleneck edge in a parametric minimum spanning tree, Cha-SODA-05b
- Manifold reconstruction from point samples, CheDeyRam-SODA-05
- Bidimensionality: new connections between FPT algorithms and PTASs, DemHaj-SODA-05a
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality, DemHaj-SODA-05b
- All maximal independent sets and dynamic dominance for sparse graphs, Epp-SODA-05
- Greedy optimal homotopy and homology generators, EriWhi-SODA-05
- Graph distances in the streaming model: the value of space, FeiKanMcG-SODA-05
- Multiple-source shortest paths in planar graphs, Kle-SODA-05
- Conformance testing in the presence of multiple faults, KumVis-SODA-05
