1 citations · 2 across the 7 of their papers we have counts for
4 papers · 1 filter
Level Planarity Is More Difficult Than We Thought
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they ou…
On 3-Coloring Circle Graphs
Patricia Bachmann, Lukas Patrick Bachmann, Ignaz Rutter +1
Given a graph with a fixed vertex order , one obtains a circle graph whose vertices are the edges of and where two such edges are adjacent if and only if their e…
Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings
Jonathan Klawitter, Peter Stumpf
In phylogenetics, tree-based networks are used to model and visualize the evolutionary history of species where reticulate events such as horizontal gene transfer have occurred. Fo…
Level Planarity: Transitivity vs. Even Crossings
Guido Brückner, Ignaz Rutter, Peter Stumpf
Recently, Fulek et al. have presented Hanani-Tutte results for (radial) level planarity, i.e., a graph is (radial) level planar if it admits a (radial) level drawing where any two…