1 | -- | 34 | Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic. Local routing in WSPD-based spanners |
35 | -- | 39 | Ahmad Biniaz. A short proof of the toughness of Delaunay triangulations |
40 | -- | 69 | Saladi Rahul. Approximate range counting revisited |
70 | -- | 108 | Karl Bringmann, Marvin Künnemann, André Nusser. Walking the dog fast in practice: Algorithm engineering of the Fréchet distance |
109 | -- | 127 | A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi, Joseph S. B. Mitchell. Planar bichromatic bottleneck spanning trees |
128 | -- | 144 | Stav Ashur, Omrit Filtser, Matthew J. Katz. A constant-factor approximation algorithm for vertex guarding a WV-polygon |
145 | -- | 177 | Sergey Avvakumov, Gabriel Nivasch. Homotopic curve shortening and the affine curve-shortening flow |
178 | -- | 197 | David Eppstein. Cubic planar graphs that cannot be drawn on few lines |