Pages that link to "Item:Q5050006"

The following pages link to The Complexity of Drawing a Graph in a Polygonal Region (Q5050006):

Displaying 8 items.

• \(\forall\exists\mathbb {R}\)-completeness and area-universality (Q1627164) (← links)
• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• The complexity of drawing graphs on few lines and few planes (Q2405289) (← links)
• The Galois Complexity of Graph Drawing: Why Numerical Solutions are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings (Q3460399) (← links)
• The complexity of the Hausdorff distance (Q6145675) (← links)
• On classifying continuous constraint satisfaction problems (Q6566470) (← links)
• Framework for \(\exists\mathbb{R}\)-completeness of two-dimensional packing problems (Q6566472) (← links)
• Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)