Maximum planar subgraphs and nice embeddings: Practical layout tools M. JüngerP. Mutzel OriginalPaper Pages: 33 - 59
The realization problem for Euclidean minimum spanning trees is NP-hard P. EadesS. Whitesides OriginalPaper Pages: 60 - 82
Drawings of graphs on surfaces with few crossings F. ShahrokhiL. A. SzékelyI. Vrt'o OriginalPaper Pages: 118 - 131