1. H. Edelsbrunner and M. Sharir, The maximum number of ways to stab n convex non-intersecting sets in the plane is 2n−2, to appear in Discrete Comput. Geom.
2. Zerlegung von Dreiecken in Dreiecke mit Nebenbedingungen;Florian;Geometriae Dedicata,1987
3. Geometric permutations and common transversals;Katchalski;Discrete Comput. Geom.,1986
4. Geometric permutations for convex sets;Katchalski;Discrete Math.,1985
5. Upper bounds on linear orderings;Wenger,1986