1. Computing the domination number of grid graphs;Alanko;Elecron. J. Comb.,2011
2. An improved binary programming formulation for the secure domination problem;Burdett;Ann. Oper. Res.,2020
3. A.P. Burger, A.P. de Villiers, J.H. van Vuuren, A binary programming approach towards achieving effective graph protection, in: Proceedings of the 2013 ORSSA Annual Conference, ORSSA, 2013, pp. 19–30.
4. Two algorithms for secure graph domination;Burger;J. Comb. Math. Comb. Comput.,2013
5. A linear algorithm for secure domination in trees;Burger;Discrete Appl. Math.,2014