On the chromatic number of some geometric hypergraphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 316-323

  Smorodinsky, Shakhar ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLOR; GEOMETRY; LINEAR ALGEBRA; NUMBER THEORY; POLYNOMIALS; TIME SERIES ANALYSIS;

CHROMATIC NUMBERS; COLOR THEOREM; HYPEREDGES; HYPERGRAPHS;

GRAPH THEORY;

EID: 33244465152     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109593     Document Type: Conference Paper

References (15)

1. N.Alon and S. Smorodinsky. Conflict-free colorings of shallow discs, manuscript, 2005.
2. K. Appel and W. Haken, "Every planar map is 4-colorable - 1: Discharging", Illinois Journal of Mathematics, 21:421-490, 1977.
3. K. Appel and W. Haken, "Every planar map is 4-colorable - 2: Reducibility", Illinois Journal of Mathematics, 21:491-567, 1977.
4. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
5. M. Sharir and P. K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, New York, 1995.
6. G. Even, Z. Lotker, D. Ron and S. Smorodinsky. Conflict-free colorings of simple geometric regionswith applications to frequency assignment in cellular networks, SIAM J. Comput. 33(1):94-136 (2003).
7. Also in Proc, 43th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), 2002.
8. A. Fiat, H. Kaplan, M. Levy, J. Matoušek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner and E. Welzl. Online conflict-free coloring for intervals. Proc. 16th Annual ACM-SIAM Symposium on Discrdete Algorithms (SODA), 2005.
9. S. Har-Peled and S. Smorodinsky, On conflict-free coloring of points and simple regions in the plane, Discrete and Comput. Geom., 34:47-70 (2005).
10. H. Kaplan and M. Sharir, Online CF coloring for halfplanes, congruent disks, and axis-parallel rectangles, manuscript, 2004.
11. K. Kedem, R. Livne, J. Pach, and M. Sharir. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom., 1:59-71, 1986.
12. P. Koebe, Kontaktprobleme der konformen Abbildung, Ber. Sächs. Akad. Wiss. Leipzig, Math-Phys. KL. 88 141-164, 1936.
13. J. Pach and G. Tóth. Conflict free colorings. In Discrete and Computational Geometry, The GoodmanPollack Festschrift. Springer Verlag, Heidelberg, 2003.
14. J. Pach and G. Tardos. Personal communication.
15. S. Smorodinsky, Combinatorial Problems in Computational Geometry, Ph.D Dissertation, School of Computer Science, Tel-Aviv University, 2003.