On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Online conflict-free coloring for intervals
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Conflict-Free Coloring of Points and Simple Regions in the Plane
Discrete & Computational Geometry
On the chromatic number of some geometric hypergraphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
How to play a coloring game against a color-blind adversary
Proceedings of the twenty-second annual symposium on Computational geometry
Conflict-Free colorings of rectangles ranges
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
How to play a coloring game against a color-blind adversary
Proceedings of the twenty-second annual symposium on Computational geometry
Conflict-free coloring for intervals: from offline to online
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Conflict-free coloring for rectangle ranges using O(n.382) colors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic conflict-free coloring for intervals: From offline to online
ACM Transactions on Algorithms (TALG)
Dynamic Offline Conflict-Free Coloring for Unit Disks
Approximation and Online Algorithms
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Conflict-free colourings of graphs and hypergraphs
Combinatorics, Probability and Computing
Tracking moving objects with few handovers
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Conflict-Free coloring made stronger
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Online conflict-free colorings for hypergraphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3k) colors so that for each point p in the union of all discs there is at least one disc in the collection containing p whose color differs from that of all other members of the collection that contain p. This is motivated by a problem on frequency assignments in cellular networks, and improves the best previously known upper bound of O(log n) when k is much smaller than n.