1. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;J. Comput. System Sci.,1976
2. Vertex covers and secure domination in graphs;Burger;Quaest. Math.,2008
3. A.P. Burger, A.P. de Villiers, J.H. Vuuren, A binary programming approach towards achieving effective graph protection, in: Proceedings of the 2013 ORSSA Annual Conference, 2013.
4. Two algorithms for secure graph domination;Burger;J. Combin. Math. Combin. Comput.,2013
5. A linear algorithm for secure domination in trees;Burger;Discrete Appl. Math.,2014