The QuaSEFE problem
From MaRDI portal
Publication:2206856
DOI10.1007/978-3-030-35802-0_21OpenAlexW2990942956MaRDI QIDQ2206856
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.08708
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- A note on 1-planar graphs
- Vertex angle and crossing angle resolution of leveled tree drawings
- On simultaneous planar graph embeddings
- On the maximum number of edges in quasi-planar graphs
- Quasi-planar graphs have a linear number of edges
- Advancements on SEFE and partitioned book embedding problems
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Planar and Quasi Planar Simultaneous Geometric Embedding
- On a Tree and a Path with no Geometric Simultaneous Embedding
- Embedding Graphs Simultaneously with Fixed Edges
- Efficient Planarity Testing
- On the NP-hardness of GRacSim drawing and k-SEFE Problems
- Geometric RAC Simultaneous Drawings of Graphs
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- Testing Planarity of Partially Embedded Graphs
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- The Number of Edges in $k$-Quasi-planar Graphs
- Simultaneous Geometric Graph Embeddings
- Embedding planar graphs at fixed vertex locations
This page was built for publication: The QuaSEFE problem
