Proc. 15th Symp. Discrete Algorithms
- Efficient algorithms for bichromatic separability, AgaAroKol-SODA-04
- An optimal randomized algorithm for maximum Tukey depth, Cha-SODA-04
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications, DemHaj-SODA-04
- Testing bipartiteness of geometric intersection graphs, Epp-SODA-04-bgig
- Quasiconvex analysis of backtracking algorithms, Epp-SODA-04-qaba
- A time efficient Delaunay refinement algorithm, Mil-SODA-04
