Pages that link to "Item:Q3066143"
From MaRDI portal
The following pages link to NP-Completeness of Spreading Colored Points (Q3066143):
Displaying 10 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- New results on stabbing segments with a polygon (Q474818) (← links)
- New results on the coarseness of bicolored point sets (Q522958) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Computing shortest heterochromatic monotone routes (Q2517794) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← links)