Pages that link to "Item:Q4585058"
From MaRDI portal
The following pages link to Intersection Graphs of Rays and Grounded Segments (Q4585058):
Displaying 22 items.
- The clique problem in ray intersection graphs (Q377488) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- Intersection graphs of segments (Q1338319) (← links)
- Intersection graphs of rays and grounded segments (Q1687911) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- On the speed of algebraically defined graph classes (Q2227284) (← links)
- On grounded \(\llcorner\)-graphs and their relatives (Q2315438) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- (Q3796750) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- Refining the hierarchies of classes of geometric intersection graphs (Q5892293) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← 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)
