2 citations · 11 across the 14 of their papers we have counts for
14 papers · 1 filter
Partial and Simultaneous Transitive Orientations via Modular Decomposition
Miriam Münch, Ignaz Rutter, Peter Stumpf
A natural generalization of the recognition problem for a geometric graph class is the problem of extending a representation of a subgraph to a representation of the whole graph. A…
Extending Partial Representations of Circular-Arc Graphs
Jiří Fiala, Ignaz Rutter, Peter Stumpf +1
The partial representation extension problem generalizes the recognition problem for classes of graphs defined in terms of vertex representations. We exhibit circular-arc graphs as…
Experimental Comparison of PC-Trees and PQ-Trees
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter
PQ-trees and PC-trees are data structures that represent sets of linear and circular orders, respectively, subject to constraints that specific subsets of elements have to be conse…
An SPQR-Tree-Like Embedding Representation for Level Planarity
Guido Brückner, Ignaz Rutter
An SPQR-tree is a data structure that efficiently represents all planar embeddings of a biconnected planar graph. It is a key tool in a number of constrained planarity testing algo…
Simultaneous FPQ-Ordering and Hybrid Planarity Testing
Giuseppe Liotta, Ignaz Rutter, Alessandra Tappini
We study the interplay between embedding constrained planarity and hybrid planarity testing. We consider a constrained planarity testing problem, called 1-Fixed Constrained Planari…
Simultaneous Representation of Proper and Unit Interval Graphs
Ignaz Rutter, Darren Strash, Peter Stumpf +1
In a confluence of combinatorics and geometry, simultaneous representations provide a way to realize combinatorial objects that share common structure. A standard case in the study…