On minimum reload cost paths, tours, and flows, vol.57, pp.254-260, 2011. ,
On the optimal, fair and channel-aware cognitive radio network reconfiguration, Computer Networks, vol.57, issue.8, pp.1739-1757, 2013. ,
Computational Geometry: Algorithms and Applications, 2008. ,
A c k n 5-approximation algorithm for treewidth, SIAM Journal on Computing, vol.45, issue.2, pp.317-378, 2016. ,
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. ,
, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms
, , 2015.
Solving connectivity problems parameterized by treewidth in single exponential time, Proc. of the 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp.150-159, 2011. ,
Fundamentals of Parameterized Complexity. Texts in Computer Science, 2013. ,
The complexity of a minimum reload cost diameter problem, Discrete Applied Mathematics, vol.156, issue.18, pp.3494-3497, 2008. ,
On minimum changeover cost arborescences, Proc. of the 10th International Symposium on Experimental Algorithms (SEA), vol.6630, pp.112-123, 2011. ,
On minimum reload cost cycle cover, Discrete Applied Mathematics, vol.164, pp.112-120, 2014. ,
Reload cost trees and network design, Networks, vol.59, issue.4, pp.365-379, 2012. ,
The minimum reload s-t path, trail and walk problems, Discrete Applied Mathematics, vol.158, issue.13, pp.1404-1417, 2010. ,
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability, Proc. of the 42nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol.9941, pp.195-206, 2016. ,
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. ,
, Constructing minimum changeover cost arborescenses in bounded treewidth graphs, Theoretical Computer Science, vol.621, pp.22-36, 2016.
Edge coloring with minimum reload/changeover costs, 2016. ,
On the complexity of constructing minimum changeover cost arborescences, Theoretical Computer Science, vol.540, pp.40-52, 2014. ,
Pathwidth, bandwidth, and completion problems to proper interval graphs with small cliques, vol.25, pp.540-561, 1996. ,
, Treewidth. Computations and Approximations, 1994.
An algorithm for computing simple k-factors, Information Processing Letters, vol.109, issue.12, pp.620-625, 2009. ,
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. ,
Faces of Matching Polyhedra, 1973. ,
The complexity of satisfiability problems, Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC '78, pp.216-226, 1978. ,
Combinatorial optimization: polyhedra and efficiency, vol.24, 2003. ,
Mixed searching and proper-path-width, Theoretical Computer Science, vol.137, issue.2, pp.253-268, 1995. ,
Reload cost problems: minimum diameter spanning tree, Discrete Applied Mathematics, vol.113, issue.1, pp.73-85, 2001. ,