The number of small semispaces of a finite set of points in the plane
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
Points and triangles in the plane and halving planes in space
Discrete & Computational Geometry
An upper bound on the number of planar K-sets
Discrete & Computational Geometry
Improved bounds for intersecting triangles and halving planes
Journal of Combinatorial Theory Series A
The colored Tverberg's problem and complexes of injective functions
Journal of Combinatorial Theory Series A
On levels in arrangements of lines, segments, planes, and triangles
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Graphs Drawn with Few Crossings Per Edge
GD '96 Proceedings of the Symposium on Graph Drawing
Improved bounds on planar k-sets and k-levels
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An improved bound for k-sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry
Balanced lines, halving triangles, and the generalized lower bound theorem
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Discrete Mathematics - Kleitman and combinatorics: a celebration
A lower bound on the number of triangulations of planar point sets
Computational Geometry: Theory and Applications
Convex Partitions with 2-Edge Connected Dual Graphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Convex partitions with 2-edge connected dual graphs
Journal of Combinatorial Optimization
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |