1. Allan, R.B., Laskar, R.: On domination and independent domination numbers of a graph. Discrete Math. 23(2), 73–76 (1978)
2. Angelopoulos, S., Dorrigiv, R., López-Ortiz, A.: On the separation and equivalence of paging strategies. In: 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 229–237 (2007)
3. Boyar, J., Favrholdt, L.M.: The relative worst order ratio for online algorithms. ACM Trans. Algorithm 3(2), 22 (2007)
4. Boyar, J., Favrholdt, L.M., Medvedev, P.: The relative worst order ratio of online bipartite graph coloring, Unpublished manuscript
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979). Under Dominating Set on p. 190