Jul 18, 2012 · We prove that there is an online coloring algorithm that colors N intervals of the real line using \Theta(\log N/k) colors.

We consider proper online colorings of hypergraphs defined by geometric regions. We prove that there is an online coloring method that colors N intervals of ...

Points are 2-colorable quasi-online such that any interval that contains at least 4 points is properly colored, i.e.,contains a red and blue point as well. B.

[11] Any finite family of wedges in the plane can be colored quasi-online with 2 colors such that any point contained by at least k = 12 of these wedges is not.

Sep 9, 2015 · We prove that there is an online coloring algorithm that colors N intervals of the real line using Θ(log N/k) colors such that for every point p ...

PDF | We consider proper online colorings of hypergraphs defined by geometric regions. Among others we prove that there is an online coloring method.

Oct 17, 2015 · We prove that there is an online coloring algorithm that colors N intervals of the real line using colors such that for every point p, contained ...

We consider proper online colorings of hypergraphs defined by geometric regions. We prove that there is an online coloring method that colors N intervals of ...

Online and Quasi-online Colorings of Wedges and Intervals · Balázs Keszegh, N. Lemons, Dömötör Pálvölgyi · Published in Order 18 July 2012 · Computer Science, ...

Sep 30, 2016 · Keszegh, Balázs and Lemons, Nathan and Pálvölgyi, Dömötör (2015) Online and Quasi-online Colorings of Wedges and Intervals.