Problems and Results around the Erdös-Szekeres Convex Polygon Theorem
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
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets
Computational Geometry and Graph Theory
Reconfirmation of two results on disjoint empty convex polygons
CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
On the minimum size of a point set containing two non-intersecting empty convex polygons
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Computational geometry column 53
ACM SIGACT News
| Hi-index | 0.00 |