M. Garey and D. Johnson, Computers and intractability: a guide to theory of NP-completeness, 1979.

S. T. Mccormick, Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, Mathematical Programming, vol.16, issue.2, pp.153-171, 1983.
DOI : 10.1007/BF02592052

I. Amdouni, P. Minet, and C. Adjih, Node coloring for dense wireless sensor networks, INRIA Research Report, vol.7588, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00582457

K. Chakrabarty, S. S. Iyengar, H. R. Qi, and E. Cho, Grid coverage for surveillance and target location in distributed sensor networks, IEEE Transactions on Computers, vol.51, issue.12, pp.1448-1453, 2002.
DOI : 10.1109/TC.2002.1146711

J. Mcculloch, P. M. Mccarthy, S. Guru, W. Peng, D. Hugo et al., Wireless sensor network deployment for water use efficiency in irrigation, Proceedings of the workshop on Real-world wireless sensor networks, REALWSN '08, 2008.
DOI : 10.1145/1435473.1435487

I. Cargiannis, A. Fishkin, C. Kaklamanis, and E. Papaioannou, A Tight Bound for Online Coloring of Disk Graphs, Theoretical Computer Science, vol.384, 2007.
DOI : 10.1007/11429647_8

V. Rajendran, K. Obraczka, and J. Garcia-luna-aceves, Energy-efficient, collision-free medium access control for wireless sensor networks, Sensys'03, 2003.

V. Rajendran, J. J. Garcia-luna-aceves, and K. Obraczka, Energy-efficient, application-aware medium access for sensor networks, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005., 2005.
DOI : 10.1109/MAHSS.2005.1542852

I. Rhee, A. Warrier, M. Aia, and J. Min, Z-MAC, Proceedings of the 3rd international conference on Embedded networked sensor systems , SenSys '05, 2005.
DOI : 10.1145/1098918.1098929

I. Rhee, A. Warrier, and L. Xu, Randomized dining philosophers to TDMA scheduling in wireless sensor networks, 2005.

S. Gobriel, D. Mosse, and R. Cleric, TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism, 2009 29th IEEE International Conference on Distributed Computing Systems, 2009.
DOI : 10.1109/ICDCS.2009.80

W. L. Lee, A. Datta, and R. Cardell-oliver, FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks, IEEE Transactions on Parallel and Distributed Systems, vol.19, issue.6, 2008.
DOI : 10.1109/TPDS.2007.70774

D. Wübben, D. Seethaler, J. Jaldén, and G. Matz, Lattice Reduction, A survey with applications in wireless communications, IEEE Signal Processing Magazine, vol.29, 2011.

B. Vallée and A. Vera, Lattice reduction in two dimensions: analyses under realistic probabilistic models, Proceedings of AofA, 2007.

P. Minet and S. Mahfoudh, SERENA: SchEduling RoutEr Nodes Activity in Wireless Ad Hoc and Sensor Networks, 2008 International Wireless Communications and Mobile Computing Conference, 2008.
DOI : 10.1109/IWCMC.2008.89

URL : https://hal.archives-ouvertes.fr/inria-00459528

A. Thue, Über die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene, Norske Vid, Selsk. Skr, issue.1, pp.1-9, 1910.

L. F. Tóth, Über die dichteste Kugellagerung, Math. Z, vol.48, pp.676-684, 1943.

A. Gräf, M. Stumpf, and G. Weissenfels, On Coloring Unit Disk Graphs, Algorithmica, vol.20, issue.3, pp.277-293, 1998.
DOI : 10.1007/PL00009196

G. A. Jones and J. M. Jones, Bezout's Identity. 1.2 in Elementary Number Theory