Proc. 6th Symp. Discrete Algorithms
- Average case analysis of dynamic graph algorithms, AlbHen-SODA-95
- Dihedral bounds for mesh generation in high dimensions, BerCheEpp-SODA-95
- Algorithms for dynamic closest pair and $n$-body potential fields, CalKos-SODA-95
- Subgraph isomorphism in planar graphs and related problems, Epp-SODA-95
- Finding subsets maximizing minimum structures, HalIwaKat-SODA-95
- Chaining multiple-alignment fragments in sub-quadratic time, MyeMil-SODA-95
