|
|
Journals in DBLP
Algorithmica
2005, volume: 41, number: 3
- Sariel Har-Peled, Soham Mazumdar
Fast Algorithms for Computing the Smallest k-Enclosing Circle. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2005, v:41, n:3, pp:147-157 [Journal]
- Vladlen Koltun, Carola Wenk
Matching Polyhedral Terrains Using Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2005, v:41, n:3, pp:159-183 [Journal]
- Sariel Har-Peled, Bardia Sadri
How Fast Is the k-Means Method? [Citation Graph (0, 0)][DBLP]
Algorithmica, 2005, v:41, n:3, pp:185-202 [Journal]
- Heikki Hyyrö, Gonzalo Navarro
Bit-Parallel Witnesses and Their Applications to Approximate String Matching. [Citation Graph (0, 0)][DBLP]
Algorithmica, 2005, v:41, n:3, pp:203-231 [Journal]
|
