The following pages link to On-Line Planarity Testing (Q4714554):
Displayed 37 items.
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← 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)
- Planar L-Drawings of Directed Graphs (Q4625136) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Lower bounds for electrical reduction on surfaces (Q5088953) (← links)
- The Optimal Packing of Eight Points in the Real Projective Plane (Q5094481) (← links)
- Graph Stories in Small Area (Q5119379) (← links)
- Minor-Closed Graph Classes with Bounded Layered Pathwidth (Q5130575) (← links)
- TESTING MUTUAL DUALITY OF PLANAR GRAPHS (Q5261018) (← 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)
- Extending upward planar graph drawings (Q5896867) (← links)
- Hierarchical partial planarity (Q5915789) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- On fully diverse sets of geometric objects and graphs (Q6039433) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q6039436) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- Maintaining triconnected components under node expansion (Q6057331) (← links)
- On the bond polytope (Q6060889) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
- (Q6087210) (← links)
- Reconfiguration of connected graph partitions (Q6093138) (← links)
- Unit-length rectangular drawings of graphs (Q6117041) (← links)
- Testing upward planarity of partial 2-trees (Q6117044) (← links)
- Small Point-Sets Supporting Graph Stories (Q6141788) (← links)
- Morphing planar graph drawings through 3D (Q6169513) (← links)
- Small point-sets supporting graph stories (Q6172204) (← links)
- On 2-strong connectivity orientations of mixed graphs and related problems (Q6182905) (← links)
- On-line convex planarity testing (Q6184373) (← links)