6 papers
Drawing Two Posets
Guido Brückner, Vera Chekan
We investigate the problem of drawing two posets of the same ground set so that one is drawn from left to right and the other one is drawn from the bottom up. The input to this pro…
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…
An SPQR-Tree-Like Embedding Representation for Upward Planarity
Guido Brückner, Markus Himmel, Ignaz Rutter
The SPQR-tree is a data structure that compactly represents all planar embeddings of a biconnected planar graph. It plays a key role in constrained planarity testing. We develop a…
Level-Planar Drawings with Few Slopes
Guido Brückner, Nadine Davina Krisam, Tamara Mchedlidze
We introduce and study level-planar straight-line drawings with a fixed number of slopes. For proper level graphs, we give an -time algorithm that…
Multilevel Planarity
Lukas Barth, Guido Brückner, Paul Jungeblut +1
In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let be a directed gr…
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…