2 citations · 11 across the 14 of their papers we have counts for
4 papers · 1 filter
Drawing Clustered Graphs on Disk Arrangements
Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter +1
Let be a planar graph and let be a partition of . We refer to the graphs induced by the vertex sets in as Clusters. Let b…
The Partition Spanning Forest Problem
Philipp Kindermann, Boris Klemz, Ignaz Rutter +2
Given a set of colored points in the plane, we ask if there exists a crossing-free straight-line drawing of a spanning forest, such that every tree in the forest contains exactly t…
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…
Inserting an Edge into a Geometric Embedding
Marcel Radermacher, Ignaz Rutter
The algorithm of Gutwenger et al. to insert an edge in linear time into a planar graph with a minimal number of crossings on , is a helpful tool for designing heuristics…