The following pages link to On-Line Planarity Testing (Q4714554):
Displayed 50 items.
- Outer 1-planar graphs (Q289919) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Topological morphing of planar graphs (Q386891) (← links)
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints (Q442281) (← links)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph (Q450560) (← links)
- Orthogonal graph drawing with flexibility constraints (Q476441) (← 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)
- Orthogonal graph drawing with inflexible edges (Q679739) (← links)
- The partial visibility representation extension problem (Q724235) (← links)
- Ortho-polygon visibility representations of embedded graphs (Q724238) (← 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)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Drawing subcubic planar graphs with four slopes and optimal angular resolution (Q1694729) (← links)
- Recognizing optimal 1-planar graphs in linear time (Q1702117) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- A linear-time algorithm for testing full outer-2-planarity (Q1727743) (← links)
- Characterizing and recognizing 4-map graphs (Q1741846) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← 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)
- Simultaneous FPQ-ordering and hybrid planarity testing (Q2034412) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Graph stories in small area (Q2206885) (← links)
- Re-embedding a 1-plane graph for a straight-line drawing in linear time (Q2235768) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Disconnectivity and relative positions in simultaneous embeddings (Q2349740) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- Möbius stanchion systems (Q2413168) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Jordan-like characterization of automorphism groups of planar graphs (Q2674344) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- Upward Planarity Testing in Practice (Q2828203) (← links)
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time (Q2961525) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← 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)