S. Agarwal and S. De, Dynamic spectrum access for energy-constrained CR: single channel versus switched multichannel, IET Communications, vol.10, issue.7, pp.761-769, 2016.

E. Amaldi, G. Galbiati, and F. Maffioli, On minimum reload cost paths, tours, and flows, Networks, vol.57, issue.3, pp.254-260, 2010.

S. Arkoulis, E. Anifantis, V. Karyotis, S. Papavassiliou, and N. Mitrou, On the optimal, fair and channel-aware cognitive radio network reconfiguration, Computer Networks, vol.57, issue.8, pp.1739-1757, 2013.

S. Bayhan and F. Alagoz, Scheduling in Centralized Cognitive Radio Networks for Energy Efficiency, IEEE Transactions on Vehicular Technology, vol.62, issue.2, pp.582-595, 2013.

S. Bayhan, S. Eryigit, F. Alagoz, and T. Tugcu, Low Complexity Uplink Schedulers for Energy-Efficient Cognitive Radio Networks, IEEE Wireless Communications Letters, vol.2, issue.3, pp.363-366, 2013.

A. P. Bianzino, C. Chaudet, D. Rossi, and J. L. Rougier, A Survey of Green Networking Research, IEEE Communications Surveys & Tutorials, vol.14, issue.1, pp.3-20, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00573049

H. L. Bodlaender, P. G. Drange, M. S. Dregi, F. V. Fomin, D. Lokshtanov et al., A $c^k n$ 5-Approximation Algorithm for Treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016.

A. Celik and A. E. Kamal, Green Cooperative Spectrum Sensing and Scheduling in Heterogeneous Cognitive Radio Networks, IEEE Transactions on Cognitive Communications and Networking, vol.2, issue.3, pp.238-248, 2016.

M. Cygan, F. V. Fomin, ?. Kowalik, D. Lokshtanov, D. Marx et al., Advanced kernelization algorithms, Parameterized Algorithms, pp.285-319, 2015.

M. Cygan, J. Nederlof, M. Pilipczuk, M. Pilipczuk, J. M. Rooij et al., Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.150-159, 2011.

C. Desset, N. Ahmed, and A. Dejonghe, Energy Savings for Wireless Terminals through Smart Vertical Handover, 2009 IEEE International Conference on Communications, pp.1-5, 2009.

R. Diestel, Extremal Graph Theory, Graph Theory, vol.173, pp.173-207, 2017.

R. G. Downey and M. R. Fellows, Parameterized Approximation, Texts in Computer Science, pp.623-644, 2013.

S. Eryigit, S. Bayhan, and T. Tugcu, Channel switching cost aware and energy-efficient cooperative sensing scheduling for cognitive radio networks, 2013 IEEE International Conference on Communications (ICC), pp.2633-2638, 2013.

G. Galbiati, The complexity of a minimum reload cost diameter problem, Discrete Applied Mathematics, vol.156, issue.18, pp.3494-3497, 2008.

G. Galbiati, S. Gualandi, and F. Maffioli, On Minimum Changeover Cost Arborescences, Experimental Algorithms, vol.6630, pp.112-123, 2011.

G. Galbiati, S. Gualandi, and F. Maffioli, On Minimum Reload Cost Cycle Cover, Discrete Applied Mathematics, vol.164, pp.112-120, 2014.

I. Gamvros, L. Gouveia, and S. Raghavan, Reload cost trees and network design, Networks, vol.59, issue.4, pp.365-379, 2011.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, 1979.

L. Gourvès, A. Lyra, C. Martinhon, and J. Monnot, The Minimum Reload s-t Path/Trail/Walk Problems, Lecture Notes in Computer Science, vol.158, pp.621-632, 2009.

D. Gözüpek, S. Buhari, and F. Alagöz, A spectrum switching delay-aware scheduling algorithm for centralized cognitive radio networks, IEEE Trans. Mobile Comput, vol.12, pp.1270-1280, 2013.

D. Gözüpek, S. Özkan, C. Paul, I. Sau, and M. Shalom, Parameterized complexity of the MINCCA problem on graphs of bounded decomposability, Theoretical Computer Science, vol.690, pp.91-103, 2017.

D. Gözüpek, H. Shachnai, M. Shalom, and S. Zaks, Constructing minimum changeover cost arborescenses in bounded treewidth graphs, Theoretical Computer Science, vol.621, pp.22-36, 2016.

D. Gözüpek and M. Shalom, Complexity of edge coloring with minimum reload/changeover costs, Networks, vol.73, pp.344-357, 2018.

D. Gözüpek, M. Shalom, A. Voloshin, and S. Zaks, On the complexity of constructing minimum changeover cost arborescences, Theoretical Computer Science, vol.540-541, pp.40-52, 2014.

K. Jansen, S. Kratsch, D. Marx, and I. Schlotter, Bin packing with fixed number of bins revisited, Journal of Computer and System Sciences, vol.79, issue.1, pp.39-49, 2013.

F. V. Jensen, Decision Graphs, Bayesian Networks and Decision Graphs, pp.109-155, 2001.

T. Kloks, Treewidth, Treewidth, Computations and Approximations, vol.842, 1994.

V. R. Konda and T. Y. Chow, Algorithm for traffic grooming in optical networks to minimize the number of transceivers, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552), pp.218-221

S. L. Lauritzen and D. J. Spiegelhalter, Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems, Journal of the Royal Statistical Society: Series B (Methodological), vol.50, issue.2, pp.157-194, 1988.

N. Shami and M. Rasti, A joint multi-channel assignment and power control scheme for energy efficiency in cognitive radio networks, 2016 IEEE Wireless Communications and Networking Conference, pp.1-6, 2016.

C. A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, issue.1, pp.85-89, 1984.

H. C. Wirth and J. Steffan, Reload cost problems: minimum diameter spanning tree, Discrete Applied Mathematics, vol.113, issue.1, pp.73-85, 2001.