An upper bound on the number of planar K-sets

Dehn-Sommerville relations, upper bound theorem, and levels in arrangements

SCG '93 Proceedings of the ninth annual symposium on Computational geometry

Constructing levels in arrangements and higher order Voronoi diagrams

SCG '94 Proceedings of the tenth annual symposium on Computational geometry

Cutting dense point sets in half

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

Geometric lower bounds for parametric matroid optimization

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

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

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

Point-sets with few k-sets

Proceedings of the fourteenth annual symposium on Computational geometry

Point sets with many k-sets

Proceedings of the sixteenth annual symposium on Computational geometry

On halving line arrangements

Discrete Mathematics - Kleitman and combinatorics: a celebration

On the bichromatic k-set problem

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

On levels in arrangements of curves, iii: further improvements

Proceedings of the twenty-fourth annual symposium on Computational geometry

On the bichromatic k-set problem

ACM Transactions on Algorithms (TALG)