1. Alipour, S., Futuhi, E., Karimi, S.: On distributed algorithms for minimum dominating set problem, from theory to application. arXiv preprint arXiv:2012.04883 (2020)
2. Alipour, S., Jafari, A.: A local constant approximation factor algorithm for minimum dominating set of certain planar graphs. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 501–502 (2020)
3. Amiri, S.A., Schmid, S., Siebertz, S.: Distributed dominating set approximations beyond planar graphs. ACM Trans. Algorithms (TALG) 15(3), 1–18 (2019)
4. Bansal, N., Umboh, S.W.: Tight approximation bounds for dominating set on graphs of bounded arboricity. Inf. Process. Lett. 122, 21–24 (2017)
5. Bonamy, M., Cook, L., Groenland, C., Wesolek, A.: A tight local algorithm for the minimum dominating set problem in outerplanar graphs. In: DISC. LIPIcs, vol. 209, pp. 13:1–13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)