Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n - 2
Discrete & Computational Geometry
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Bounding the number of geometric permutations induced by k-transversals
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
On lazy randomized incremental construction
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
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
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
| Hi-index | 0.00 |