Partial and Constrained Level Planarity

DOI10.1137/1.9781611974782.130MaRDI QIDQ4575877zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Beyond level planarity
• Multilevel planarity
• Multilevel planarity
• Some Constrained Notions of Planarity
• Practical Level Planarity Testing and Layout with Embedding Constraints
• scientific article; zbMATH DE number 6419797
• Radial level planarity with fixed embedding
• A characterization of level planar graphs

Cited in

(25)

• Lower levels of Euclidean planes
• Level planarity: transitivity vs. even crossings
• Level-planarity: transitivity vs. even crossings
• Extending simple drawings
• An SPQR-tree-like embedding representation for upward planarity
• Beyond level planarity: cyclic, torus, and simultaneous level planarity
• The importance of being proper (in clustered-level planarity and T-level planarity)
• Windrose planarity: embedding graphs with direction-constrained edges
• Beyond Clustered Planar Graphs
• Computing k-modal embeddings of planar digraphs
• scientific article; zbMATH DE number 7559402 (Why is no real title available?)
• Multilevel planarity
• Multilevel planarity
• Level-planar drawings with few slopes
• Level-planar drawings with few slopes
• Inserting one edge into a simple drawing is hard
• scientific article; zbMATH DE number 7765366 (Why is no real title available?)
• Constrained planarity in practice: engineering the synchronized planarity algorithm
• Experimental comparison of PC-trees and PQ-trees
• Extending partial 1-planar drawings
• Constrained level planarity is FPT with respect to the vertex cover number
• Constrained and ordered level planarity parameterized by the number of levels
• On k-plane insertion into plane drawings
• The parameterized complexity of extending stack layouts
• Crossing-optimal extension of simple drawings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575877)