Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem Luciano GualĂ Guido Proietti OriginalPaper 14 September 2007 Pages: 171 - 191
k-Nearest-Neighbor Clustering and Percolation Theory Shang-Hua TengFrances F. Yao OriginalPaper 22 September 2007 Pages: 192 - 211
Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry Eitan Bachmat OriginalPaper 08 September 2007 Pages: 212 - 231
The Number of Tree Stars Is O *(1.357 k ) Bernhard FuchsWalter KernXinhui Wang OriginalPaper Open access 14 September 2007 Pages: 232 - 244
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope Hervé FournierAntoine Vigneron OriginalPaper 22 September 2007 Pages: 245 - 257