On the maximal number of edges of many faces in an arrangement
Journal of Combinatorial Theory Series A
More on k-sets of finite sets in the plane
Discrete & Computational Geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
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
Planning algorithm for a convex polygonal object in two-dimensional polygonal space
Discrete & Computational Geometry
Lower bounds on the length of monotone paths in arrangements
Discrete & Computational Geometry
On geometric optimization with few violated constraints
SCG '94 Proceedings of the tenth 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
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Cutting cylces of rods in space
Proceedings of the fourteenth annual symposium on Computational geometry
| Hi-index | 0.01 |