The following pages link to On-Line Planarity Testing (Q4714554):
Displayed 22 items.
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra (Q652524) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- An algorithm for constructing star-shaped drawings of plane graphs (Q1037784) (← links)
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem (Q1278276) (← links)
- Incremental convex planarity testing (Q1854448) (← links)
- Towards area requirements for drawing hierarchically planar graphs (Q1870562) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree (Q3000509) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Spherical-Rectangular Drawings (Q3605510) (← links)
- Topological Morphing of Planar Graphs (Q3611848) (← links)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges (Q3611849) (← links)
- On the Hardness and Approximability of Planar Biconnectivity Augmentation (Q5323069) (← links)
- Dynamic Distance Hereditary Graphs Using Split Decomposition (Q5387744) (← links)
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY (Q5493896) (← links)
- Advances in the Planarization Method: Effective Multiple Edge Insertions (Q5895513) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)