Beyond Level Planarity
DOI10.1007/978-3-319-50106-2_37zbMath1436.68376arXiv1510.08274OpenAlexW2963969949MaRDI QIDQ2961540
Patrizio Angelini, Giuseppe Di Battista, Giordano Da Lozzo, Maurizio Patrignani, Fabrizio Frati, Ignaz Rutter
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.08274
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
- Unnamed Item
- 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
- A new perspective on clustered planarity as a combinatorial embedding problem
- 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
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- Cyclic Level Planarity Testing and Embedding
- SOFSEM 2004: Theory and Practice of Computer Science
This page was built for publication: Beyond Level Planarity
