Recommendations
Cited in
(93)- Non-planar core reduction of graphs
- Testing planarity of geometric automorphisms in linear time
- An algorithm for constructing star-shaped drawings of plane graphs
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
- Linear-time recognition of map graphs with outerplanar witness
- 3-connected reduction for regular graph covers
- Dynamic planar embeddings of dynamic graphs
- Drawing subcubic planar graphs with four slopes and optimal angular resolution
- Recognizing optimal 1-planar graphs in linear time
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs
- Fully dynamic representations of interval graphs
- A linear-time algorithm for testing full outer-2-planarity
- Characterizing and recognizing 4-map graphs
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
- Incremental convex planarity testing
- Towards area requirements for drawing hierarchically planar graphs
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Graph stories in small area
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Relaxing the constraints of clustered planarity
- Monotone drawings of graphs with fixed embedding
- Disconnectivity and relative positions in simultaneous embeddings
- Möbius stanchion systems
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Jordan-like characterization of automorphism groups of planar graphs
- Parameterized complexity of graph planarity with restricted cyclic orders
- Alpha-algorithms for incremental planarity testing (extended abstract)
- Testing Full Outer-2-planarity in Linear Time
- Triangulating planar graphs while keeping the pathwidth small
- Upward planarity testing in practice: SAT formulations and comparative study
- Outer 1-planar graphs
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Simultaneous orthogonal planarity
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Fully dynamic planarity testing with applications
- Monotone Drawings of Graphs with Fixed Embedding
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions
- Simultaneous embedding of embedded planar graphs
- Spherical-Rectangular Drawings
- Topological Morphing of Planar Graphs
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Planarity testing of doubly periodic infinite graphs
- Topological morphing of planar graphs
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Planar L-drawings of directed graphs
- Orthogonal graph drawing with flexibility constraints
- On-line Planar Graph Embedding
- Decremental SPQR-trees for Planar Graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Upward book embeddings of st-graphs
- Lower bounds for electrical reduction on surfaces
- The optimal packing of eight points in the real projective plane
- Graph Stories in Small Area
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Testing mutual duality of planar graphs
- On the Hardness and Approximability of Planar Biconnectivity Augmentation
- Dynamic Distance Hereditary Graphs Using Split Decomposition
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- Advances in the planarization method: effective multiple edge insertions
- Graph isomorphism restricted by lists
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
- On fully diverse sets of geometric objects and graphs
- Parameterized complexity of graph planarity with restricted cyclic orders
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario
- Maintaining triconnected components under node expansion
- On the bond polytope
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Inserting Multiple Edges into a Planar Graph
- scientific article; zbMATH DE number 7765396 (Why is no real title available?)
- Reconfiguration of connected graph partitions
- Unit-length rectangular drawings of graphs
- Testing upward planarity of partial 2-trees
- Small Point-Sets Supporting Graph Stories
- Small point-sets supporting graph stories
- On 2-strong connectivity orientations of mixed graphs and related problems
- On-line convex planarity testing
- Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Maintaining triconnected components under node expansion
- Unit-length rectangular drawings of graphs
- Large matchings in maximal 1-planar graphs
- Orthogonal graph drawing with inflexible edges
- Rectilinear-upward planarity testing of digraphs
- Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
- The price of upwardness
- Efficient recognition of subgraphs of planar cubic bridgeless graphs
- Ranking and unranking of the planar embeddings of a planar graph
- Dynamic embeddings of dynamic single-source upward planar graphs
- The price of upwardness
- Simple realizability of abstract topological graphs
- A branch-and-cut approach to the crossing number problem
This page was built for publication: On-Line Planarity Testing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714554)
