Pages that link to "Item:Q1725774"

The following pages link to The complexity of drawing a graph in a polygonal region (Q1725774):

Displaying 12 items.

• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
• Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
• One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
• On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
• Polygon simplification by minimizing convex corners (Q2272403) (← links)
• The complexity of drawing graphs on few lines and few planes (Q2405289) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
• The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
• Testing the planar straight-line realizability of 2-trees with prescribed edge lengths (Q6563990) (← links)