On minimum reload cost paths, tours, and flows. Networks, pp.254-260, 2011. ,
DOI : 10.1002/net.20423
On the optimal, fair and channel-aware cognitive radio network reconfiguration, Computer Networks, vol.57, issue.8, pp.1739-1757, 2013. ,
DOI : 10.1016/j.comnet.2013.03.004
Parameterized Algorithms, 2015. ,
DOI : 10.1007/978-3-319-21275-3
OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE, International Journal of Computational Geometry & Applications, vol.22, issue.03, pp.187-206, 2012. ,
DOI : 10.1142/S0218195912500045
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
A survey on the energy efficiency of vertical handover mechanisms, Proc. of the International Conference on Wireless and Mobile Networks (WiMoN), 2013. ,
Parameterized Complexity Theory. Texts in Theoretical Computer Science, 2006. ,
The complexity of a minimum reload cost diameter problem, Discrete Applied Mathematics, vol.156, issue.18, pp.3494-3497, 2008. ,
DOI : 10.1016/j.dam.2008.02.013
On Minimum Changeover Cost Arborescences, Proc. of the 10th International Symposium on Experimental Algorithms (SEA), pp.112-123, 2011. ,
DOI : 10.1007/978-3-642-20662-7_10
On Minimum Reload Cost Cycle Cover, Discrete Applied Mathematics, vol.164, pp.112-120, 2014. ,
DOI : 10.1016/j.dam.2011.12.006
Algorithmic Applications of Tree-Cut Width, Proc. of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS), pp.348-360, 2015. ,
DOI : 10.1007/978-3-662-48054-0_29
The Minimum Reload s-t Path/Trail/Walk Problems, Discrete Applied Mathematics, vol.113, issue.3, pp.1404-1417, 2010. ,
DOI : 10.1016/S0166-218X(00)00392-9
A Spectrum Switching Delay-Aware Scheduling Algorithm for Centralized Cognitive Radio Networks, IEEE Transactions on Mobile Computing, vol.12, issue.7, pp.1270-1280, 2013. ,
DOI : 10.1109/TMC.2012.101
Constructing minimum changeover cost arborescences in bounded treewidth graphs, 2016. ,
On the complexity of constructing minimum changeover cost arborescences, Theoretical Computer Science, vol.540, pp.40-52, 2014. ,
An FPT 2-Approximation for Tree-cut Decomposition, Proc. of the 13th Workshop on Approximation and Online Algorithms (WAOA), pp.35-46, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01225569
Invitation to Fixed-Parameter Algorithms, 2006. ,
DOI : 10.1093/acprof:oso/9780198566076.001.0001
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems, Journal of Computer and System Sciences, vol.67, issue.4, pp.757-771, 2003. ,
DOI : 10.1016/S0022-0000(03)00078-3
Reload cost problems: minimum diameter spanning tree, Discrete Applied Mathematics, vol.113, issue.1, pp.73-85, 2001. ,
DOI : 10.1016/S0166-218X(00)00392-9
URL : http://doi.org/10.1016/s0166-218x(00)00392-9
The structure of graphs not admitting a fixed immersion, Journal of Combinatorial Theory, Series B, vol.110, pp.47-66, 2015. ,
DOI : 10.1016/j.jctb.2014.07.003