Pages that link to "Item:Q1932476"

The following pages link to Integer realizations of disk and segment graphs (Q1932476):

Displaying 32 items.

• Sphere and dot product representations of graphs (Q411410) (← links)
• On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
• Recognition and complexity of point visibility graphs (Q512262) (← links)
• On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
• Arrangements of pseudocircles and circles (Q741610) (← links)
• Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
• The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
• Implicit representation conjecture for semi-algebraic graphs (Q1735676) (← links)
• Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
• On the speed of algebraically defined graph classes (Q2227284) (← links)
• Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
• The number of disk graphs (Q2509768) (← links)
• Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
• (Q4817649) (← links)
• On Embeddability of Unit Disk Graphs onto Straight Lines (Q5042239) (← links)
• The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
• Optimality program in segment and string graphs (Q5920196) (← links)
• On embeddability of unit disk graphs onto straight lines (Q6038709) (← links)
• (Q6124760) (← links)
• The complexity of the Hausdorff distance (Q6145675) (← links)
• Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality (Q6156090) (← links)
• Logical labeling schemes (Q6172301) (← links)
• Topological art in simple galleries (Q6204773) (← links)
• The complexity of recognizing geometric hypergraphs (Q6560147) (← links)
• On classifying continuous constraint satisfaction problems (Q6566470) (← 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)
• Representing matroids over the reals is \(\exists \mathbb{R}\)-complete (Q6606993) (← links)
• Implicit representation of sparse hereditary families (Q6624164) (← links)