D. Ajwani, K. Elbassioni, S. Govindarajan, and S. Ray, Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors, Discrete & Computational Geometry, vol.26, issue.2, pp.39-52, 2012.
DOI : 10.1007/s00454-012-9425-5

N. Alon and J. Spencer, The Probabilistic Method, Wiley-Interscience Series in Discrete Mathematics
DOI : 10.1002/0471722154

G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden et al., Decomposition of Multiple Coverings into More Parts, Discrete & Computational Geometry, vol.38, issue.2, pp.706-723, 2010.
DOI : 10.1007/s00454-009-9238-3

G. Aloupis, J. Cardinal, S. Collette, S. Langerman, and S. Smorodinsky, Coloring Geometric Range Spaces, Discrete & Computational Geometry, vol.229, issue.3, pp.348-362, 2009.
DOI : 10.1007/s00454-008-9116-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.2396

A. Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl et al., Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles, Proc. Workshop on Data Structures and Algorithms (WADS), pp.73-84, 2013.
DOI : 10.1007/978-3-642-40104-6_7
URL : https://hal.archives-ouvertes.fr/hal-00947748

A. Bar-noy, P. Cheilaris, S. Olonetsky, and S. Smorodinsky, Online Conflict-Free Colouring for Hypergraphs, Combinatorics, Probability and Computing, vol.19, issue.04, pp.493-516, 2010.
DOI : 10.1137/0401048

A. Bar-noy, P. Cheilaris, and S. Smorodinsky, Deterministic conflict-free coloring for intervals, ACM Transactions on Algorithms, vol.4, issue.4, 2008.
DOI : 10.1145/1383369.1383375
URL : http://dspace.lib.ntua.gr/handle/123456789/28349

P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry, 2005.

J. Cardinal, K. B. Knauer, P. Micek, and T. Ueckerdt, Making triangles colorful. CoRR, abs, 1212.

J. Cardinal and M. Korman, Coloring planar homothets and three-dimensional hypergraphs, Computational Geometry, vol.46, issue.9, pp.1027-1035, 2013.
DOI : 10.1016/j.comgeo.2013.06.004
URL : http://arxiv.org/abs/1101.0565

T. M. Chan, E. Grant, J. Könemann, and M. Sharpe, Weighted Capacitated, Priority, and Geometric Set Cover via Improved Quasi-Uniform Sampling, Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.1576-1585, 2012.
DOI : 10.1137/1.9781611973099.125
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.3608

X. Chen, J. Pach, M. Szegedy, and G. Tardos, Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. Random Struct, Algorithms, vol.34, issue.1, pp.11-23, 2009.

L. Kenneth, K. R. Clarkson, and . Varadarajan, Improved approximation algorithms for geometric set cover, Discrete & Computational Geometry, vol.37, issue.1, pp.43-58, 2007.

S. Felsner and S. Kappes, Orthogonal Surfaces and Their CP-Orders, Order, vol.22, issue.1, pp.19-47, 2008.
DOI : 10.1007/s11083-007-9075-z
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.2158

R. Fulek, Coloring geometric hypergraph defined by an arrangement of half-planes, Proc. Canadian Conference on Computational Geometry (CCCG), pp.71-74, 2010.

M. Gibson and K. R. Varadarajan, Optimally Decomposing Coverings with Translates of a Convex Polygon, Discrete & Computational Geometry, vol.38, issue.2, pp.313-333, 2011.
DOI : 10.1007/s00454-011-9353-9

B. Keszegh, Coloring half-planes and bottomless rectangles, Computational Geometry, vol.45, issue.9, pp.495-507, 2012.
DOI : 10.1016/j.comgeo.2011.09.004
URL : http://arxiv.org/abs/1105.0169

B. Keszegh, N. Lemons, and D. Pálvölgyi, Online and Quasi-online Colorings of Wedges and Intervals, Proc. Theory and Practice of Computer Science (SOFSEM), pp.292-306, 2013.
DOI : 10.1007/s11083-015-9374-8

B. Keszegh and D. Pálvölgyi, Octants Are Cover-Decomposable, Discrete & Computational Geometry, vol.38, issue.3, pp.598-609, 2012.
DOI : 10.1007/s00454-011-9377-1
URL : http://arxiv.org/abs/1101.3773

B. Keszegh and D. Pálvölgyi, Octants are cover-decomposable into many coverings. CoRR, abs, 1207.
DOI : 10.1016/j.comgeo.2013.12.001
URL : http://arxiv.org/abs/1207.0672

B. Keszegh and D. Pálvölgyi, Convex polygons are self-coverable. CoRR, abs, 1307.
DOI : 10.1007/s00454-014-9582-9
URL : http://arxiv.org/abs/1307.2411

J. Pach, Decomposition of multiple packing and covering, Kolloq. ¨ uber Diskrete Geom, issue.2, p.169

J. Pach, Covering the plane with convex polygons, Discrete & Computational Geometry, vol.21, issue.1, pp.73-81, 1986.
DOI : 10.1007/BF02187684

J. Pach and G. Tardos, Coloring axis-parallel rectangles, Journal of Combinatorial Theory, Series A, vol.117, issue.6, pp.776-782, 2010.
DOI : 10.1016/j.jcta.2009.04.007
URL : http://doi.org/10.1016/j.jcta.2009.04.007

J. Pach and G. Tardos, Tight lower bounds for the size of epsilon-nets, Proc. Symposium on Computational Geometry (SoCG), pp.458-463, 2011.

J. Pach, G. Tardos, and G. Tóth, Indecomposable coverings, Proc. 7th China-Japan Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT), pp.135-148, 2005.
DOI : 10.1007/978-3-540-70666-3_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.380.7923

J. Pach and G. Tóth, Decomposition of multiple coverings into many parts, Computational Geometry, vol.42, issue.2, pp.127-133, 2009.
DOI : 10.1016/j.comgeo.2008.08.002

D. Pálvölgyi, Indecomposable Coverings with Concave Polygons, Discrete & Computational Geometry, vol.38, issue.2, pp.577-588, 2010.
DOI : 10.1007/s00454-009-9194-y

R. Rado, Covering Theorems for Ordered Sets, Proc. London Math. Soc, pp.2-50509, 1948.
DOI : 10.1112/plms/s2-50.7.509
URL : http://plms.oxfordjournals.org/cgi/content/short/s2-50/1/509

S. Smorodinsky, On The Chromatic Number of Geometric Hypergraphs, SIAM Journal on Discrete Mathematics, vol.21, issue.3, pp.676-687, 2007.
DOI : 10.1137/050642368

S. Smorodinsky and Y. Yuditsky, Polychromatic coloring for half-planes, Proc. Scandinavian Worskhop on Algorithms Theory (SWAT), pp.118-126, 2010.
DOI : 10.1016/j.jcta.2011.07.001
URL : http://doi.org/10.1016/j.jcta.2011.07.001

G. Tardos and G. Tóth, Multiple Coverings of the Plane with Triangles, Discrete & Computational Geometry, vol.38, issue.2, pp.443-450, 2007.
DOI : 10.1007/s00454-007-1345-4

K. Varadarajan, Weighted geometric set cover via quasi-uniform sampling, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.641-648, 2010.
DOI : 10.1145/1806689.1806777