Partial and Constrained Level Planarity

DOI10.1137/1.9781611974782.130zbMath1411.68077OpenAlexW4248028038MaRDI QIDQ4575877

Guido Brückner, Ignaz Rutter

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.130

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (15)

Extending simple drawings ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Unnamed Item ⋮ Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity ⋮ Level planarity: transitivity vs. even crossings ⋮ Extending upward planar graph drawings ⋮ Unnamed Item ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Computing k-modal embeddings of planar digraphs ⋮ Inserting one edge into a simple drawing is hard ⋮ Multilevel Planarity ⋮ Beyond Clustered Planar Graphs ⋮ Level-planarity: transitivity vs. even crossings

This page was built for publication: Partial and Constrained Level Planarity