scientific article; zbMATH DE number 7765366
From MaRDI portal
Publication:6065397
DOI10.4230/lipics.isaac.2020.8MaRDI QIDQ6065397
Publication date: 14 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- On the complexity of embedding planar graphs to minimize certain distance measures
- Inserting an edge into a planar graph
- On-line maintenance of triconnected components with SPQR-trees
- An SPQR-tree-like embedding representation for upward planarity
- A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs
- A structural characterization of planar combinatorial graphs
- Simultaneous Orthogonal Planarity
- Hanani-Tutte and Monotone Drawings
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Hierarchies and planarity theory
- Level Planar Embedding in Linear Time
- Partial and Constrained Level Planarity
- Dividing a Graph into Triconnected Components
- Upward Planar Drawing of Single-Source Acyclic Digraphs
- Testing Planarity of Partially Embedded Graphs
- Optimal Orthogonal Graph Drawing with Convex Bend Costs
- TESTING MUTUAL DUALITY OF PLANAR GRAPHS
- Hierarchical partial planarity
This page was built for publication:
