1 citations · 2 across the 7 of their papers we have counts for
11 papers
Towards the Recognition of Oriented Interval Graphs
Lukas P. Bachmann, Jiří Fiala, Miriam Münch +3
Oriented interval graphs, a recent generalization of interval graphs introduced by Gutowski et al. [GD 2022], are intersection graphs of intervals, each of which is oriented either…
Two Results on Outer-String Graphs
Todor Antić, Vít Jelínek, Jan Kratochvíl +1
An \emph{outer-string representation} of a graph is an intersection representation of where vertices are represented by curves (strings) inside the unit disk and each curve…
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…
Partial and Simultaneous Transitive Orientations via Modular Decomposition
Miriam Münch, Ignaz Rutter, Peter Stumpf
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A…
Extending Partial Representations of Circular-Arc Graphs
Jiří Fiala, Ignaz Rutter, Peter Stumpf +1
The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as…
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…
Towards a characterization of stretchable aligned graphs
Marcel Radermacher, Ignaz Rutter, Peter Stumpf
We consider the problem of stretching pseudolines in a planar straight-line drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawi…
Simultaneous Representation of Proper and Unit Interval Graphs
Ignaz Rutter, Darren Strash, Peter Stumpf +1
In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study…
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…
Local and Union Boxicity
Thomas Bläsius, Peter Stumpf, Torsten Ueckerdt
The boxicity of a graph is the smallest integer such that is the intersection of interval graphs, or equivalently, that is the intersect…