3 papers
cs.DS2026
Monotone Clustered Level Planarity
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
We consider the combination of the two constrained planarity problems Level- and Clustered Planarity. Traditionally, level-planar drawings with convex clusters have been studied in…
math.CO2025
Crossing Number of 3-Plane Drawings
Miriam Goetze, Michael Hoffmann, Ignaz Rutter +1
We study 3-plane drawings, that is, drawings of graphs in which every edge has at most three crossings. We show how the recently developed Density Formula for topological drawings…
cs.CG2024
A Simple Partially Embedded Planarity Test Based on Vertex-Addition
Simon D. Fink, Ignaz Rutter, Sandhya T. P
In the Partially Embedded Planarity problem, we are given a graph together with a topological drawing of a subgraph of . The task is to decide whether the drawing can be…