Showing cs.DSShow all
3 papers · 1 filter
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…
cs.DS2025
Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
Thomas Depian, Simon D. Fink, Robert Ganian +1
In spite of the extensive study of stack and queue layouts, many fundamental questions remain open concerning the complexity-theoretic frontiers for computing stack and queue layou…
cs.DS2025
Parameterized Complexity of Simultaneous Planarity
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
Given input graphs , where each pair , with shares the same graph , the problem Simultaneous Embedding With Fixed Edges (SEFE) asks wh…