23 citations · 158 across the 42 of their papers we have counts for
7 papers · 1 filter
Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees
Jonathan Klawitter, Felix Klesen, Moritz Niederer +1
We consider the problem of drawing multiple gene trees inside a single species tree in order to visualize multispecies coalescent trees. Specifically, the drawing of the species tr…
Morphing Planar Graph Drawings Through 3D
Kevin Buchin, Will Evans, Fabrizio Frati +4
In this paper, we investigate crossing-free 3D morphs between planar straight-line drawings. We show that, for any two (not necessarily topologically equivalent) planar straight-li…
Parameterized Approaches to Orthogonal Compaction
Walter Didimo, Siddharth Gupta, Philipp Kindermann +3
Orthogonal graph drawings are used in applications such as UML diagrams, VLSI layout, cable plans, and metro maps. We focus on drawing planar graphs and assume that we are given an…
Coloring Mixed and Directional Interval Graphs
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter +3
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph is a function that assigns to each vertex in…
Bounding and computing obstacle numbers of graphs
Martin Balko, Steven Chaplick, Robert Ganian +4
An obstacle representation of a graph consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of to points such that…
Outside-Obstacle Representations with All Vertices on the Outer Face
Oksana Firman, Philipp Kindermann, Jonathan Klawitter +3
An obstacle representation of a graph consists of a set of polygonal obstacles and a drawing of as a visibility graph with respect to the obstacles: vertices are mapped to…