Some notes on the Erdős-Szekeres theorem
Discrete Mathematics
Sets in R d with no large empty convex subsets
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
On a partition into convex polygons
Discrete Applied Mathematics
European Journal of Combinatorics
On the generalized Erdős-Skekeres conjecture—a new upper bound
Discrete Mathematics
A Tverberg-type result on multicolored simplices
Computational Geometry: Theory and Applications
Computing the largest empty convex subset of a set of points
SCG '85 Proceedings of the first annual symposium on Computational geometry
Partitioning point sets in space into disjoint convex polytopes
Computational Geometry: Theory and Applications
Cyclic polytopes and oriented matroids
European Journal of Combinatorics - Special issue on combinatorics of polytopes
Ramsey-remainder for convex sets and the Erdős—Szekeres theorem
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
On the number of disjoint convex quadrilaterals for a planar point set
Computational Geometry: Theory and Applications
On the existence of a point subset with a specified number of interior points
Discrete Mathematics
On the Existence of a Point Subset with 4 or 5 Interior Points
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
On Convex Decompositions of Points
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Chromatic variants of the Erdös-Szekeres theorem on points in convex position
Computational Geometry: Theory and Applications
On empty convex polygons in a planar point set
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On empty convex polygons in a planar point set
Journal of Combinatorial Theory Series A
Erdös-Szekeres theorem with forbidden order types
Journal of Combinatorial Theory Series A
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
Computational Geometry and Graph Theory
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Lower bounds for the number of small convex k-holes
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |