1. Quasi-planar graphs have a linear number of edges
2. Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
3. [ABC+11] Patrizio Angelini, Till Bruckdorfer, Marco Chiesa, Fabrizio Frati, Michael Kaufmann, and Claudio Squarcella, On the area requirements of Euclidean minimum spanning trees, Algorithms and Data Structures(Frank Dehne, John Iacono, and Jrg-Rdiger Sack, eds.), Lecture Notes in Computer Science, vol.6844, Springer, Berlin/Heidelberg,2011, 10.1007/978-3-642-22300-6 3, pp.25-36.
4. Lecture Notes in Computer Science;Argyriou Evmorfia,2012
5. Maximizing the Total Resolution of Graphs