1. Nonobtuse triangulation of polygons;Baker;Discrete Comput. Geom.,1988
2. On non-intersecting Eulerian circuits;Bent;Discrete Appl. Math.,1987
3. Polynomial-size nonobtuse triangulation of polygons;Bern;Proc. 7th ACM Ann. Symp. on Computational Geometry,1991
4. On straight line representing of planar graphs;Fáry;Acta Sci. Math.,1948
5. Small sets supporting Fáry embeddings of planar graphs;de Fraysseix;Proc. 20th Ann. ACM Symp. on Theory of Computing,1988