The following pages link to A new planarity test (Q1960413):
Displaying 16 items.
- Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
- Errors in graph embedding algorithms (Q632808) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- PC trees and circular-ones arrangements. (Q1401263) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- Simpler algorithms for testing two-page book embedding of partitioned graphs (Q1748996) (← links)
- Affine and projective tree metric theorems (Q1950414) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516) (← links)
- Algorithms for Drawing Planar p-petal Graphs (Q2831832) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- A simulated annealing algorithm for the maximum planar subgraph problem (Q4831415) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- A dichotomy result for cyclic-order traversing games (Q5091020) (← links)
- Planarity Algorithms via PQ-Trees (Extended Abstract) (Q5300998) (← links)
