Conflict-Free Colorings of Rectangles Ranges
From MaRDI portal
Publication:5449804
DOI10.1007/11672142_20zbMATH Open1136.68567OpenAlexW1553380098MaRDI QIDQ5449804FDOQ5449804
Authors: Nabil H. Mustafa, Khaled Elbassioni 
Publication date: 19 March 2008
Published in: STACS 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11672142_20
Recommendations
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
- scientific article; zbMATH DE number 2209737
- Dynamic conflict-free colorings in the plane
- Dynamic conflict-free colorings in the plane
Cited In (17)
- Conflict-free coloring of graphs
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Dynamic Offline Conflict-Free Coloring for Unit Disks
- Dynamic conflict-free colorings in the plane
- Title not available (Why is that?)
- Conflict-free connection of trees
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- On conflict-free connection of graphs
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Dynamic conflict-free colorings in the plane
- Graph unique-maximum and conflict-free colorings
- Conflict-free coloring of intersection graphs
- Conflict-free coloring of intersection graphs
- Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
- Ordered coloring grids and related graphs
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
This page was built for publication: Conflict-Free Colorings of Rectangles Ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449804)
