23 citations · 158 across the 42 of their papers we have counts for
8 papers · 1 filter
Coloring and Recognizing Directed Interval Graphs
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen +3
A \emph{mixed interval graph} is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particul…
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…
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…
The Complexity of Finding Tangles
Oksana Firman, Philipp Kindermann, Boris Klemz +3
We study the following combinatorial problem. Given a set of y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers…
Computing Height-Optimal Tangles Faster
Oksana Firman, Philipp Kindermann, Alexander Ravsky +2
We study the following combinatorial problem. Given a set of y-monotone wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders…
Beyond Outerplanarity
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta +2
We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \emph{convex drawings}. We consider two families of graph classes wit…