Dynamic Conflict-Free Colorings in the Plane

DOI10.4230/LIPIcs.ISAAC.2017.27zbMath1457.68285OpenAlexW2756819611MaRDI QIDQ5136246

Aleksandar Markovic, Mark T. de Berg

Publication date: 25 November 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8250/pdf/LIPIcs-ISAAC-2017-27.pdf/

zbMATH Keywords

dynamic data structuresconflict-free colorings

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items

Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points

Cites Work

• Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
• Strong conflict-free coloring for intervals
• On neighbors in geometric permutations.
• Conflict-free coloring of points and simple regions in the plane
• A decomposition theorem for partially ordered sets
• Conflict-Free Coloring Made Stronger
• Decomposable searching problems I. Static-to-dynamic transformation
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
• Conflict-Free Coloring and its Applications
• Online Conflict‐Free Coloring for Intervals
• Online Conflict-Free Colorings for Hypergraphs
• Improved Bounds for the Union of Locally Fat Objects in the Plane
• Unnamed Item
• Unnamed Item
• Unnamed Item