ACM Computing Surveys (CSUR)
When crossings count — approximating the minimum spanning tree
Proceedings of the sixteenth annual symposium on Computational geometry
Minimizing the stabbing number of matchings, trees, and triangulations
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for connecting sites across barriers
Proceedings of the twenty-second annual symposium on Computational geometry
Testing contractibility in planar rips complexes
Proceedings of the twenty-fourth annual symposium on Computational geometry
Shooting permanent rays among disjoint polygons in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Halving lines and measure concentration in the plane
Proceedings of the twenty-fifth annual symposium on Computational geometry
Proceedings of the twenty-sixth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Orthogonal subdivisions with low stabbing numbers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Optimal private halfspace counting via discrepancy
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
Proceedings of the twenty-eighth annual symposium on Computational geometry
Absolute approximation of Tukey depth: Theory and experiments
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |