1. Bermond, J.-C., Galtier, J., Klasing, R., Morales, N., Pérennes, S.: Hardness and approximation of gathering in static radio networks. PPL 16(2), 165–183 (2006)
2. Lecture Notes in Computer Science;J.-C. Bermond,2008
3. Bermond, J.-C., Correa, R., Yu, M.-L.: Optimal Gathering Protocols on Paths under Interference Constraints. Discrete Mathematics 309(18), 5574–5587 (2009)
4. Bermond, J.-C., Peters, J.: Efficient gathering in radio grids with interference. In: Proc. AlgoTel 2005, Presqu’île de Giens, pp. 103–106 (2005)
5. Bermond, J.-C., Yu, M.-L.: Optimal gathering algorithms in multi-hop radio tree networks with interferences. Ad Hoc and S.W.N. 9(1-2), 109–128 (2010)