Pages that link to "Item:Q2874591"
From MaRDI portal
The following pages link to Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set (Q2874591):
Displaying 13 items.
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Hitting and Piercing Rectangles Induced by a Point Set (Q4925240) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking (Q5351888) (← links)
- On conflict-free coloring of points and simple regions in the plane (Q5361612) (← links)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
- Conflict-free colouring of subsets (Q6624182) (← links)
