@phdthesis{Fink2014,
  author    = {Fink, Martin},
  title     = {Crossings, Curves, and Constraints in Graph Drawing},
  publisher = {W{\"u}rzburg University Press},
  isbn      = {978-3-95826-002-3 (print)},
  doi       = {10.25972/WUP-978-3-95826-003-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-98235},
  school      = {W{\"u}rzburg University Press},
  pages     = {222},
  year      = {2014},
  abstract  = {In many cases, problems, data, or information can be modeled as graphs. Graphs can be used as a tool for modeling in any case where connections between distinguishable objects occur. Any graph consists of a set of objects, called vertices, and a set of connections, called edges, such that any edge connects a pair of vertices. For example, a social network can be modeled by a graph by transforming the users of the network into vertices and friendship relations between users into edges. Also physical networks like computer networks or transportation networks, for example, the metro network of a city, can be seen as graphs. For making graphs and, thereby, the data that is modeled, well-understandable for users, we need a visualization. Graph drawing deals with algorithms for visualizing graphs. In this thesis, especially the use of crossings and curves is investigated for graph drawing problems under additional constraints. The constraints that occur in the problems investigated in this thesis especially restrict the positions of (a part of) the vertices; this is done either as a hard constraint or as an optimization criterion.},
  subject      = {Graphenzeichnen},
  language  = {en}
}
@phdthesis{Kindermann2016,
  author    = {Kindermann, Philipp},
  title     = {Angular Schematization in Graph Drawing},
  publisher = {W{\"u}rzburg University Press},
  address   = {W{\"u}rzburg},
  isbn      = {978-3-95826-020-7 (print)},
  doi       = {10.25972/WUP-978-3-95826-021-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-112549},
  school      = {W{\"u}rzburg University Press},
  pages     = {184},
  year      = {2016},
  abstract  = {Graphs are a frequently used tool to model relationships among entities. A graph is a binary relation between objects, that is, it consists of a set of objects (vertices) and a set of pairs of objects (edges). Networks are common examples of modeling data as a graph. For example, relationships between persons in a social network, or network links between computers in a telecommunication network can be represented by a graph. The clearest way to illustrate the modeled data is to visualize the graphs. The field of Graph Drawing deals with the problem of finding algorithms to automatically generate graph visualizations. The task is to find a "good" drawing, which can be measured by different criteria such as number of crossings between edges or the used area. In this thesis, we study Angular Schematization in Graph Drawing. By this, we mean drawings with large angles (for example, between the edges at common vertices or at crossing points). The thesis consists of three parts. First, we deal with the placement of boxes. Boxes are axis-parallel rectangles that can, for example, contain text. They can be placed on a map to label important sites, or can be used to describe semantic relationships between words in a word network. In the second part of the thesis, we consider graph drawings visually guide the viewer. These drawings generally induce large angles between edges that meet at a vertex. Furthermore, the edges are drawn crossing-free and in a way that makes them easy to follow for the human eye. The third and final part is devoted to crossings with large angles. In drawings with crossings, it is important to have large angles between edges at their crossing point, preferably right angles.},
  language  = {en}
}
@phdthesis{Loeffler2021,
  author    = {L{\"o}ffler, Andre},
  title     = {Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid},
  edition   = {1. Auflage},
  publisher = {W{\"u}rzburg University Press},
  address   = {W{\"u}rzburg},
  isbn      = {978-3-95826-146-4},
  doi       = {10.25972/WUP-978-3-95826-147-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-215746},
  school      = {W{\"u}rzburg University Press},
  pages     = {viii, 161},
  year      = {2021},
  abstract  = {Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing. In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid. For the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic. For the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.},
  subject      = {Graphenzeichnen},
  language  = {en}
}