1. Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces;Bonichon,2010
2. Weak matching points with triangles;Panahi,2011
3. There are planar graphs almost as good as the complete graph;Chew;J. Comput. Syst. Sci.,1989
4. Toughness and Delaunay triangulations;Dillencourt,1987
5. Matching points with squares;Ábrego;Discrete Comput. Geom.,2009