Beyond level planarity: cyclic, torus, and simultaneous level planarity
DOI10.1016/j.tcs.2019.11.024zbMath1436.68377OpenAlexW2990891330MaRDI QIDQ2283039
Fabrizio Frati, Ignaz Rutter, Patrizio Angelini, Giordano Da Lozzo, Maurizio Patrignani, Giuseppe Di Battista
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.11.024
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (9)
Cites Work
- Upward planar drawings on the standing and the rolling cylinders
- Generalized \(k\)-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation
- On simultaneous planar graph embeddings
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A characterization of level planar graphs
- The importance of being proper
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Beyond Level Planarity
- Classification of Planar Upward Embedding
- Radial Level Planarity Testing and Embedding in Linear Time
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- On the Characterization of Level Planar Trees by Minimal Patterns
- Hierarchies and planarity theory
- Total Ordering Problem
- Partial and Constrained Level Planarity
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Cyclic Level Planarity Testing and Embedding
- SOFSEM 2004: Theory and Practice of Computer Science
This page was built for publication: Beyond level planarity: cyclic, torus, and simultaneous level planarity