1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
2. Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Pure and Applied Mathematics, vol. 208. Dekker, New York (1998)
3. Kuhn, F., von Rickenbach, P., Wattenhofer, R., Welzl, E., Zollinger, A.: Interference in cellular networks: The minimum membership set cover problem. In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16–29, 2005, Proceedings, pp. 188–198 (2005)
4. Agrawal, A., Choudhary, P., Narayanaswamy, N.S., Nisha, K.K., Ramamoorthi, V.: Parameterized complexity of minimum membership dominating set. In: Mutzel, P., Rahman, M.S., Slamin (eds.) WALCOM: Algorithms and Computation. Springer, Cham (2022)
5. Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS’97, Bratislava, Slovakia, August 25–29, 1997, Proceedings, pp. 19–36 (1997)