Applications of random sampling in computational geometry, II
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Points and triangles in the plane and halving planes in space
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Results on k-sets and j-facets via continuous motion
Proceedings of the fourteenth annual symposium on Computational geometry
Parametric polymatroid optimization and its geometric applications
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Modeling planar configurations
SCG '85 Proceedings of the first annual symposium on Computational geometry
Proceedings of the sixteenth annual symposium on Computational geometry
Approximation algorithms for layered manufacturing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Acquisition and Propagation of Spatial Constraints Based on Qualitative Information
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Mathematics - Kleitman and combinatorics: a celebration
The Clarkson–Shor Technique Revisited and Extended
Combinatorics, Probability and Computing
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Detecting cuts in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Detecting cuts in sensor networks
ACM Transactions on Sensor Networks (TOSN)
GD'04 Proceedings of the 12th international conference on Graph Drawing
On the complexity of higher order abstract voronoi diagrams
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |