A. Dumitrescu, and J. Pach. Partitioning colored point sets into monochromatic parts, Int. J. of Computational Geometry and Applications. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Chromatic Variants of the Erdös-Szekeres Theorem.. - Devillers.. (Correct)
.... for n = S to be large enough, can we find an m hole of S falling into one of the three described chromatic classes Or an m subset in convex position Although colored versions of several results concerning finite point configurations have already been considered by many authors (see e.g. [1, 3, 11, 36]) the original motivation for us to study these problems came from a di#erent area. A finite set # of curves in the plane is a separator for the sets S 1 , S k if every connected component in R contains objects only from some S i . We also say that each connected component is ....
A. Dumitrescu and J. Pach. Partitioning colored point sets into monochromatic parts. Intern. J. Comp. Geom. Appl., 12:401--412, 2002.
On the Intersection Number of Matchings and Minimum.. - Merino, Salazar, Urrutia (2003) (Correct)
No context found.
A. Dumitrescu, and J. Pach. Partitioning colored point sets into monochromatic parts, Int. J. of Computational Geometry and Applications.
On Spanning Trees and Cycles of Multicolored Point Sets.. - Kano, Merino, Urrutia (2003) (Correct)
No context found.
A. Dumitrescu, and J. Pach. Partitioning colored point sets into monochromatic parts, Int. J. of Computational Geometry and Applications.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC