Fast Algorithms for Computing the Smallest k-Enclosing Circle Sariel Har-PeledSoham Mazumdar OriginalPaper 15 October 2004 Pages: 147 - 157
Matching Polyhedral Terrains Using Overlays of Envelopes Vladlen KoltunCarola Wenk OriginalPaper 15 October 2004 Pages: 159 - 183
How Fast Is the k-Means Method? Sariel Har-PeledBardia Sadri OriginalPaper 08 December 2004 Pages: 185 - 202
Bit-Parallel Witnesses and Their Applications to Approximate String Matching Heikki HyyröGonzalo Navarro OriginalPaper 08 September 2004 Pages: 203 - 231
