SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Almost tight upper bounds for the single cell and zone problems in three dimensions
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
A new technique for analyzing substructures in arrangements
Proceedings of the eleventh annual symposium on Computational geometry
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Lower bounds for linear satisfiability problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
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
Space---Query-Time Tradeoff for Computing the Visibility Polygon
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
All-maximum and all-minimum problems under some measures
Journal of Discrete Algorithms
| Hi-index | 0.01 |