|
Journals in DBLP
Algorithmica 2007, volume: 49, number: 3
Exact and Approximate Truthful Mechanisms for the Shortest Paths Tree Problem. [Citation Graph (, )][DBLP]
k-Nearest-Neighbor Clustering and Percolation Theory. [Citation Graph (, )][DBLP]
Average Case Analysis of Disk Scheduling, Increasing Subsequences and Spacetime Geometry. [Citation Graph (, )][DBLP]
The Number of Tree Stars Is O *(1.357 k ). [Citation Graph (, )][DBLP]
A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope. [Citation Graph (, )][DBLP]
|