Pages that link to "Item:Q5144878"

The following pages link to Complexity of Geometric k-Planarity for Fixed k (Q5144878):

Displaying 10 items.

• RAC-drawability is \(\exists \mathbb{R} \)-complete (Q2151432) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• On the Complexity of Some Geometric Problems With Fixed Parameters (Q5856668) (← links)
• The Complexity of Angular Resolution (Q6075714) (← links)
• RAC-Drawability is ∃ℝ-complete and Related Results (Q6181953) (← links)
• Topological art in simple galleries (Q6204773) (← links)
• Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete (Q6547943) (← links)
• The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
• On classifying continuous constraint satisfaction problems (Q6566470) (← links)
• Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)