Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model. - Thomas Bläsius; Guido Brückner; Ignaz Rutter (ESA, 2014)

An SPQR-Tree-Like Embedding Representation for Upward Planarity. - Guido Brückner; Markus Himmel; Ignaz Rutter (GD, 2019)

Drawing Two Posets. - Guido Brückner; Vera Chekan (SOFSEM, 2021)

Multilevel Planarity. - Lukas Barth; Guido Brückner; Paul Jungeblut; Marcel Radermacher (J. Graph Algorithms Appl., 2021)

Radial Level Planarity with Fixed Embedding. - Guido Brückner; Ignaz Rutter (J. Graph Algorithms Appl., 2021)

Planarity Variants for Directed Graphs. - Guido Brückner (2021)

Level-Planar Drawings with Few Slopes. - Guido Brückner; Nadine Davina Krisam; Tamara Mchedlidze (Algorithmica, 2022)

Level-Planarity: Transitivity vs. Even Crossings. - Guido Brückner; Ignaz Rutter; Peter Stumpf (Electron. J. Comb., 2022)

An SPQR-tree-like embedding representation for level planarity. - Guido Brückner; Ignaz Rutter (J. Comput. Geom., 2023)

Extending Partial Representations of Circle Graphs in Near-Linear Time. - Guido Brückner; Ignaz Rutter; Peter Stumpf (Algorithmica, 2024)

Partial and constrained level planarity. - Guido Brückner; Ignaz Rutter (Theor. Comput. Sci., 2025)