Euclidean minimum spanning trees and bichromatic closest pairs
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Selecting distances in the plane
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On the sum of squares of cell complexities in hyperplane arrangements
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Relative neighborhood graphs in three dimensions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computing many faces in arrangements of lines and segments
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Spheres, molecules, and hidden surface removal
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On lazy randomized incremental construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
New lower bounds for Hopcroft's problem
Proceedings of the eleventh annual symposium on Computational geometry
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Geometric lower bounds for parametric matroid optimization
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the twelfth annual symposium on Computational geometry
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
RAPID: randomized pharmacophore identification for drug design
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Geometric matching under noise: combinatorial bounds and algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the number of congruent simplices in a point
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
On the distinct distances determined by a planar point set
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry
Incidences between points and circles in three and higher dimensions
Proceedings of the eighteenth annual symposium on Computational geometry
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
On counting point-hyperplane incidences
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Distinct distances in homogeneous sets
Proceedings of the nineteenth annual symposium on Computational geometry
Proceedings of the nineteenth annual symposium on Computational geometry
Distinct distances in three and higher dimensions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Number of Incidences Between Points and Curves
Combinatorics, Probability and Computing
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
Lenses in arrangements of pseudo-circles and their applications
Journal of the ACM (JACM)
Distinct Distances in Three and Higher Dimensions
Combinatorics, Probability and Computing
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Point–Line Incidences in Space
Combinatorics, Probability and Computing
Incidences of not-too-degenerate hyperplanes
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Stability versus speed in a computable algebraic model
Theoretical Computer Science - Real numbers and computers
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
On the diameter of separated point sets with many nearly equal distances
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the number of tetrahedra with minimum, unit, and distinct volumes in three-space
Combinatorics, Probability and Computing
Extremal problems on triangle areas in two and three dimensions
Proceedings of the twenty-fourth annual symposium on Computational geometry
An improved bound on the number of unit area triangles
Proceedings of the twenty-fifth annual symposium on Computational geometry
Extremal problems on triangle areas in two and three dimensions
Journal of Combinatorial Theory Series A
A dynamic data structure for flexible molecular maintenance and informatics
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Nearly equal distances and Szemerédi's regularity lemma
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Facility location problems with uncertainty on the plane
Discrete Optimization
| Hi-index | 0.00 |