R. Addanki and B. Saha, Fully Dynamic Set Cover-Improved and Simple, 2018.

S. Assadi, K. Onak, B. Schieber, and S. Solomon, Fully dynamic maximal independent set with sublinear update time, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, 2018.

S. Assadi, K. Onak, B. Schieber, and S. Solomon, Fully Dynamic Maximal Independent Set with Sublinear in n Update Time, pp.1919-1936, 2019.

S. Ta-c-s,

A. Bernstein, S. Forster, and M. Henzinger, A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1899-1918, 2019.

A. Bernstein and C. Stein, Faster fully dynamic matchings with small approximation ratios, Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pp.692-711, 2016.

V. Sivakumar-r-bevan-das and . Bharghavan, Routing in ad-hoc networks using a virtual backbone, Proceedings of the 6th International Conference on Computer Communications and Networks (IC3N'97), pp.1-20, 1997.

S. Bhattacharya, D. Chakrabarty, M. Henzinger, and D. Nanongkai, Dynamic algorithms for graph coloring, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1-20, 2018.

S. Bhattacharya, M. Henzinger, and G. F. Italiano, Deterministic fully dynamic data structures for vertex cover and matching, SIAM Journal on Computing, vol.47, issue.3, pp.859-887, 2018.

S. Butenko, X. Cheng, C. A. Oliveira, and P. Pardalos, A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks, Recent developments in cooperative control and optimization, pp.61-73, 2004.

X. Cheng, X. Huang, D. Li, W. Wu, and D. Du, A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks, Networks: An International Journal, vol.42, issue.4, pp.202-208, 2003.

V. , A Greedy Heuristic for the Set-Covering Problem, Mathematics of Operations Research, vol.4, issue.3, pp.233-235, 1979.

C. Demetrescu and G. F. Italiano, A New Approach to Dynamic All Pairs Shortest Paths, J. ACM, vol.51, issue.6, pp.968-992, 2004.

D. Du and P. Wan, Connected dominating set: theory and applications, vol.77, 2012.

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM (JACM), vol.45, issue.4, pp.634-652, 1998.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, vol.20, issue.4, pp.374-387, 1998.

L. Guibas, N. Milosavljevi?, and A. Motskin, Connected dominating sets on dynamic geometric graphs, Computational Geometry, vol.46, issue.2, pp.160-172, 2013.

A. Gupta, R. Krishnaswamy, A. Kumar, and D. Panigrahi, Online and dynamic algorithms for set cover, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp.537-550, 2017.

M. Gupta and S. Khan, Simple dynamic algorithms for Maximal Independent Set and other problems, 2018.

M. Gupta and R. Peng, Fully dynamic (1+ e)-approximate matchings, Foundations of Computer Science (FOCS), 2013 IEEE 54th Annual Symposium on, pp.548-557, 2013.

J. Håstad, Clique is hard to approximate withinn 1-?, Acta Mathematica, vol.182, issue.1, pp.105-142, 1999.

J. Holm, K. De-lichtenberg, and M. Thorup, Poly-logarithmic Deterministic Fullydynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-edge, and Biconnectivity, J. ACM, vol.48, issue.4, pp.723-760, 2001.

L. Jia, R. Rajaraman, and T. Suel, An efficient distributed algorithm for constructing small dominating sets, Distributed Computing, vol.15, issue.4, p.17, 2002.

. Viggo-kann, On the approximability of NP-complete optimization problems, 1992.

F. Kuhn and R. Wattenhofer, Constant-time distributed dominating set approximation, Distributed Computing, vol.17, issue.4, pp.303-310, 2005.

D. Nanongkai, T. Saranurak, and C. Wulff-nilsen, Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.950-961, 2017.

O. Neiman and S. Solomon, Simple deterministic algorithms for fully dynamic maximal matching, ACM Transactions on Algorithms (TALG), vol.12, issue.1, p.7, 2016.

E. Sampathkumar and . Walikar, The connected domination number of a graph, J. Math. Phys, 1979.

D. Daniel, R. E. Sleator, and . Tarjan, A data structure for dynamic trees, Journal of computer and system sciences, vol.26, issue.3, pp.362-391, 1983.

S. Solomon, Fully Dynamic Maximal Matching in Constant Update Time, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp.325-334, 2016.

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, pp.7-14, 1999.