New Approaches to Classic Graph-Embedding Problems - Orthogonal Drawings & Constrained Planarity
Thomas Bläsius · Repository KITopen (Karlsruhe Institute of Technology) · 2015
Drawings of graphs are often used to represent a given data set in a human-readable way. In this thesis, we consider different classic algorithmic problems that arise when automatically generating graph drawings. More specifically, we solve some open problems in the context of orthogonal drawings and advance the current state of research on the problems clustered planarity and simultaneous planarity.