21 citations · 120 across the 54 of their papers we have counts for
5 papers · 1 filter
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…
On 3-Coloring Circle Graphs
Patricia Bachmann, Ignaz Rutter, Peter Stumpf
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…
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…
Parameterized Complexity of Vertex Splitting to Pathwidth at most 1
Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter
Motivated by the planarization of 2-layered straight-line drawings, we consider the problem of modifying a graph such that the resulting graph has pathwidth at most 1. The problem…
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…