Publisher
Springer International Publishing
Reference27 articles.
1. Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: Fast branching algorithm for cluster vertex deletion. CoRR, abs/1306.3877 (2013)
2. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40-42), 3736–3756 (2010)
3. Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: Breaking through the o(n2) barrier. In: FOCS, pp. 381–389 (2000)
4. Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. In: STOC, pp. 159–166 (2003)
5. Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86–124 (1989)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dynamic treewidth;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Dynamic Kernels for Hitting Sets and Set Packing;Algorithmica;2022-06-22
3. Multistage Vertex Cover;Theory of Computing Systems;2022-04
4. Dynamic Parameterized Problems and Algorithms;ACM Transactions on Algorithms;2020-10-31
5. Improved approximation algorithms for hitting 3-vertex paths;Mathematical Programming;2019-04-22