Pages that link to "Item:Q3132834"
From MaRDI portal
The following pages link to Who Needs Crossings? Hardness of Plane Graph Rigidity (Q3132834):
Displaying 12 items.
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Computing exact solutions of consensus halving and the Borsuk-Ulam theorem (Q2221804) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem (Q5092341) (← links)
- Enumerating Grid Layouts of Graphs (Q5119387) (← links)
- The complexity of the Hausdorff distance (Q6145675) (← links)
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths (Q6563990) (← links)
- Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)
- Unit-length rectangular drawings of graphs (Q6636988) (← links)
- A tight bound for the number of edges of matchstick graphs (Q6642298) (← links)