1. Complexity of secure sets;Bliem;Algorithmica,2017
2. B. Bliem, S. Woltran, Defensive alliances in graphs of bounded treewidth, CoRR abs/1107.04251, 2017. URL https://arxiv.org/abs/1707.04251.
3. Global defensive alliances of trees and cartesian product of paths and cycles;Chang;Discrete Appl. Math.,2012
4. Capacitated domination and covering: A parameterized perspective;Dom,2008
5. Alliances in graphs: Parameterized algorithms and on partitioning series-parallel graphs;Enciso,2009