Online Conflict‐Free Coloring for Intervals
From MaRDI portal
Publication:5422489
DOI10.1137/S0097539704446682zbMath1124.68077OpenAlexW2076856026WikidataQ54308749 ScholiaQ54308749MaRDI QIDQ5422489
János Pach, Haim Kaplan, Meital Levy, Ke Chen, Elchanan Mossel, Amos Fiat, Shakhar Smorodinsky, Uli Wagner, Micha Sharir, Ermo Welzl, Ji{ří} Matoušek
Publication date: 22 October 2007
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704446682
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Randomized algorithms (68W20) Combinatorial complexity of geometric structures (52C45)
Related Items
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs, Dynamic conflict-free colorings in the plane, On Conflict-Free Multi-coloring, Conflict-Free Colourings of Uniform Hypergraphs With Few Edges, Conflict-Free Coloring of Graphs, Conflict-Free Coloring of Intersection Graphs, Conflict-free coloring bounds on open neighborhoods, A note about online nonrepetitive coloring \(k\)-trees, Graph unique-maximum and conflict-free colorings, Polynomial Time Algorithms for Bichromatic Problems, Conflict-free coloring of intersection graphs of geometric objects, Conflict-free coloring of points on a line with respect to a set of intervals, On conflict-free connection of graphs, Conflict-Free Colourings of Graphs and Hypergraphs, On variants of conflict-free-coloring for hypergraphs, Online Conflict-Free Colouring for Hypergraphs, Conflict-free coloring of string graphs, Dynamic Offline Conflict-Free Coloring for Unit Disks, CONFLICT-FREE COLORINGS OF SHALLOW DISCS, Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles, Conflict-free connection of trees, Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces, Ordered Coloring Grids and Related Graphs, Online hypergraph coloring with rejection, Dynamic Conflict-Free Colorings in the Plane
