Readable Graph Drawings
Graphs are not only a common tool for modelling ans solving problems in computer science, but are also often used for visualizing data. Concrete drawings of graphs are understood also by nonexperts; the representation of a link or a connection is intuitive. Moreover, methods for graph drawing can be used for visualizing real networks such as metro networks. We develop and investigate algorithms for creating readable drawings of graphs.
The literature describes many provably good algorithms for drawing graphs. Rarely, however, do these algorithms produce wellreadable drawings. That is beacause it is often already hard to optimize only one desired criterion such as the number of bends or the number of edge crossings. This leads to other readability requirements not being fulfilled, perhaps because some edges are very long or some have many bends. It can, therefore, also make sense to do without solving partial problems optimally and rather balance several criteria against each other. A drawing can, for example, become better readable if there are slightly more crossings that have, in contrast, very high crossing angles, which improves the readability of a single crossing a lot.
Most existing algorithms for graph drawing work, furthermore, only on planar graphs, that is, graphs that can be drawn without crossings. Especially graphs based on realworld data are, however, often not planar. If such graphs are big, which is not unusual, then single nodes or edges are hardly distinguishable in a drawing. There exist several approaches to draw such graphs: groups of edges are bundled or clusters of nodes are formed. So far, however, there is no method that always produces readable drawings.
Researchers
 Alexander Wolff
 Steven Chaplick
 Fabian Lipp
 Myroslav Kryven
 André Löffler
 Martin Fink (until 2014)
 Philipp Kindermann (until 2015)
Publications

Computing Storylines with Few Block Crossings. in Lecture Notes in Computer Science, F. Frati, Ma, K. L. (eds.) (2017).

Beyond Outerplanarity. in Lecture Notes in Computer Science, F. Frati, Ma, K. L. (eds.) (2017).

Planar LDrawings of Directed Graphs. in Lecture Notes in Computer Science, F. Frati, Ma, K. L. (eds.) (2017).

Snapping Graph Drawings to the Grid Optimally. in Lecture Notes in Computer Science, Y. Hu, Nöllenburg, M. (eds.) (2016). (Vol. 9801) 144151.

Obstructing Visibilities with One Obstacle. in Lecture Notes in Computer Science, Y. Hu, Nöllenburg, M. (eds.) (2016). (Vol. 9801) 295308.

Block Crossings in Storyline Visualizations. in Lecture Notes in Computer Science, Y. Hu, Nöllenburg, M. (eds.) (2016). (Vol. 9801) 382398.

Drawing Graphs on Few Lines and Few Planes. in Lecture Notes in Computer Science, Y. Hu, Nöllenburg, M. (eds.) (2016). (Vol. 9801) 166180.

Faster ForceDirected Graph Drawing with the WellSeparated Pair Decomposition. in Lecture Notes in Computer Science, E. Di Giacomo, Lubiw, A. (eds.) (2015). (Vol. 9411) 5259.

Pixel and Voxel Representations of Graphs. in Lecture Notes in Computer Science, E. Di Giacomo, Lubiw, A. (eds.) (2015). (Vol. 9411) 472486.

Luatodonotes: Boundary Labeling for Annotations in Texts. in Lecture Notes in Computer Science, C. Duncan, Symvonis, A. (eds.) (2014). (Vol. 8871) 7688.

Drawing Graphs within Restricted Area. in Lecture Notes in Computer Science, C. Duncan, Symvonis, A. (eds.) (2014). (Vol. 8871) 367379.

Simultaneous Drawing of Planar Graphs with RightAngle Crossings and Few Bends. in Lecture Notes in Computer Science, C. Duncan, Symvonis, A. (eds.) (2014). (Vol. 8871) 515516.

On Monotone Drawings of Trees. in Lecture Notes in Computer Science, C. Duncan, Symvonis, A. (eds.) (2014). (Vol. 8871) 488500.

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. in Lecture Notes in Computer Science, M. van Kreveld, Speckmann, B. (eds.) (2012). (Vol. 7034) 441442.

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles. in Lecture Notes in Computer Science, M. S. Rahman, Nakano, S. ichi (eds.) (2012). (Vol. 7157) 186197.

Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, FixedParameter Tractability. in Algorithmica (2012). 62(12) 309332.

Schematization in Cartography, Visualization, and Computational Geometry in Dagstuhl Seminar Proceedings (2011). (Vol. 10461) Schloss Dagstuhl.

Drawing and Labeling HighQuality Metro Maps by MixedInteger Programming. in IEEE Transactions on Visualization and Computer Graphics (2011). 17(5) 626641.

ManhattanGeodesic Embedding of Planar Graphs. in Lecture Notes in Computer Science, D. Eppstein, Gansner, E. R. (eds.) (2010). (Vol. 5849) 207218.

Drawing Binary Tanglegrams: An Experimental Evaluation. (2009). 106119.

Untangling a Planar Graph. in Discrete Computational Geometry (2009). 42(4) 542569.

Cover Contact Graphs. in Lecture Notes in Computer Science, S. H. Hong, Nishizeki, T., Quan, W. (eds.) (2008). (Vol. 4875) 171182.

Minimizing IntraEdge Crossings in Wiring Diagrams and Public Transport Maps. in Lecture Notes in Computer Science, M. Kaufmann, Wagner, D. (eds.) (2007). (Vol. 4372) 270281.

Drawing Subway Maps: A Survey. in Informatik~ Forschung & Entwicklung (2007). 22(1) 2344.

Straightening Drawings of Clustered Hierarchical Graphs. in Lecture Notes in Computer Science, J. van Leeuwen, Italiano, G. F., van der Hoek, W., Meinel, C., Sack, H., Plasil, F. (eds.) (2007). (Vol. 4362) 177186.

Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. in Computational Geometry: Theory and Applications (2007). 36(3) 215236.

Geometrische Netzwerke und ihre Visualisierung. (2005).

A Simple Proof for the NPHardness of Edge Labeling. Technical Report (11/2000), (2000).