Keyword

fully dynamic algorithms

Description: Algorithms for maintaining solutions to computational problems as data undergoes both insertions and deletions, especially in dynamic graph problems.
OpenAlex ID: keywords/fully-dynamic-algorithms
2004 · Camil Demetrescu, Giuseppe F. Italiano · Journal of the ACM · 333
2003 · V. King · Annual Symposium on Foundations of Computer Science · 266
2013 · Seiya Yokohama · Discrete mathematics and its applications · 170
2011 · Giuseppe F. Italiano, Yahav Nussbaum, et al. · ACM Symposium on Theory of Computing (STOC) · 138
2012 · Surender Baswana, Sumeet Khurana, et al. · ACM Transactions on Algorithms · 113
2011 · Konstantin Tretyakov, Abel Armas-Cervantes, et al. · ACM International Conference on Information and Knowledge Management (CIKM) · 108
1997 · Monika R. Henzinger, Valerie King · Lecture notes in computer science · 104
2020 · Saurabh Sawlani, Junxing Wang · ACM Symposium on Theory of Computing (STOC) · 94
2012 · Liam Roditty, Uri Zwick · SIAM Journal on Computing · 94
2008 · Liam Roditty, Uri Zwick · SIAM Journal on Computing · 88
2003 · Camil Demetrescu, Giuseppe F. Italiano · ACM Symposium on Theory of Computing (STOC) · 77
2001 · Monika R. Henzinger, Valerie King · SIAM Journal on Computing · 75
1998 · Zoran Ivkovic, Errol L. Lloyd · SIAM Journal on Computing · 68
2017 · Sayan Bhattacharya, Deeparnab Chakrabarty, et al. · Lecture notes in computer science · 56
2019 · Amir Abboud, Raghavendra Addanki, et al. · ACM Symposium on Theory of Computing (STOC) · 52
2004 · L. Roditty, U. Zwick · Annual Symposium on Foundations of Computer Science · 52
2003 · L. Roditty, U. Zwick · Annual Symposium on Foundations of Computer Science · 49
2021 · Aaron Bernstein, Aditi Dudeja, et al. · ACM Symposium on Theory of Computing (STOC) · 48
1994 · Monika Rauch · ACM Symposium on Theory of Computing (STOC) · 44
2001 · Camil Demetrescu, Daniele Frigioni, et al. · Lecture notes in computer science · 43
2015 · Elisabetta Bergamini, Henning Meyerhenke · Lecture notes in computer science · 38
2006 · Camil Demetrescu, Giuseppe F. Italiano · Journal of Discrete Algorithms · 38
2021 · Sebastian Forster, Gramoz Goranci, et al. · Society for Industrial and Applied Mathematics eBooks · 37
2017 · Arar, Moab, Chechik, Shiri, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 36
Works count: 148
Citation count: 3,308
Year
Topic
Type