1 citations · 3 across the 14 of their papers we have counts for
6 papers · 1 filter
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
Thomas Depian, Simon D. Fink, Alexander Firbas +3
In this paper, we study the Pattern Avoidance problem of determining whether a given graph admits a linear vertex order which avoids a given pattern , i.e., a vertex sequenc…
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…
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…
Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm
Simon D. Fink, Ignaz Rutter
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived fro…
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…
Maintaining Triconnected Components under Node Expansion
Simon D. Fink, Ignaz Rutter
SPQR-trees are a central component of graph drawing and are also important in many further areas of computer science. From their inception onwards, they have always had a strong re…