* Bhattacharya et al. [2018b] Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano.  Dynamic algorithms via the primal-dual method.  _Inf. Comput._ , 261:219–239, 2018b.  doi: 10.1016/j.ic.2018.02.005.  URL https://doi.org/10.1016/j.ic.2018.02.005.
  * Bhattacharya et al. [2019] Sayan Bhattacharya, Monika Henzinger, and Danupon Nanongkai.  A new deterministic algorithm for dynamic set cover.  In David Zuckerman, editor, _60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019_ , pages 406–423. IEEE Computer Society, 2019.  doi: 10.1109/FOCS.2019.00033.  URL https://doi.org/10.1109/FOCS.2019.00033.
  * Bhattacharya et al. [2020a] Sayan Bhattacharya, Deeparnab Chakrabarty, and Monika Henzinger.  Deterministic dynamic matching in O(1) update time.  _Algorithmica_ , 82(4):1057–1080, 2020a.  doi: 10.1007/s00453-019-00630-4.  URL https://doi.org/10.1007/s00453-019-00630-4.
  * Bhattacharya et al. [2020b] Sayan Bhattacharya, Monika Henzinger, Danupon Nanongkai, and Xiaowei Wu.  An improved algorithm for dynamic set cover.  _CoRR_ , abs/2002.11171, 2020b.  URL https://arxiv.org/abs/2002.11171.
  * Bhore et al. [2020] Sujoy Bhore, Guangping Li, and Martin Nöllenburg.  An algorithmic study of fully dynamic independent sets for map labeling.  In Grandoni et al. [2020], pages 19:1–19:24.  ISBN 978-3-95977-162-7.  doi: 10.4230/LIPIcs.ESA.2020.19.  URL https://doi.org/10.4230/LIPIcs.ESA.2020.19.
  * Bisenius et al. [2018] Patrick Bisenius, Elisabetta Bergamini, Eugenio Angriman, and Henning Meyerhenke.  Computing top-_k_ closeness centrality in fully-dynamic graphs.  In Rasmus Pagh and Suresh Venkatasubramanian, editors, _Proc. of the Twentieth Workshop on Algorithm Engineering and Experiments, ALENEX 2018, New Orleans, LA, USA, January 7-8, 2018_ , pages 21–35. SIAM, 2018.  ISBN 978-1-61197-505-5.  doi: 10.1137/1.9781611975055.3.  URL https://doi.org/10.1137/1.9781611975055.3.
  * Boykov and Kolmogorov [2004] Yuri Boykov and Vladimir Kolmogorov.  An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision.  _IEEE Trans. Pattern Anal. Mach. Intell._ , 26(9):1124–1137, 2004.  doi: 10.1109/TPAMI.2004.60.  URL https://doi.org/10.1109/TPAMI.2004.60.
  * Brandes et al. [2008] U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, and D. Wagner.  On Modularity Clustering.  _IEEE Transactions on Knowledge and Data Engineering_ , 20(2):172–188, 2008.  doi: 10.1109/TKDE.2007.190689.  URL https://doi.org/10.1109/TKDE.2007.190689.
  * Buchhold et al. [2020] Valentin Buchhold, Daniel Delling, Dennis Schieferdecker, and Michael Wegner.  Fast and stable repartitioning of road networks.  In _18th International Symposium on Experimental Algorithms (SEA 2020)_ , volume 160 of _LIPIcs_ , pages 26:1–26:15. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.  doi: 10.4230/LIPIcs.SEA.2020.26.  URL https://doi.org/10.4230/LIPIcs.SEA.2020.26.
  * Bulteau et al. [2016] Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, and Rasmus Pagh.  Triangle counting in dynamic graph streams.  _Algorithmica_ , 76(1):259–278, 2016.  doi: 10.1007/s00453-015-0036-4.  URL https://doi.org/10.1007/s00453-015-0036-4.
  * Buriol et al. [2006] Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohler.  Counting triangles in data streams.  In Stijn Vansummeren, editor, _Proc. of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 26-28, 2006, Chicago, Illinois, USA_ , pages 253–262. ACM, 2006.  ISBN 1-59593-318-2.  doi: 10.1145/1142351.1142388.  URL https://doi.org/10.1145/1142351.1142388.
  * Buriol et al. [2008] Luciana S. Buriol, Mauricio G. C. Resende, and Mikkel Thorup.  Speeding up dynamic shortest-path algorithms.  _INFORMS J. Comput._ , 20(2):191–204, 2008\.  doi: 10.1287/ijoc.1070.0231.  URL https://doi.org/10.1287/ijoc.1070.0231.
  * Cattaneo et al. [2002] Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, and Giuseppe F. Italiano.  Maintaining dynamic minimum spanning trees: An experimental study.  In David M. Mount and Clifford Stein, editors, _Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers_ , volume 2409 of _Lecture Notes in Computer Science_ , pages 111–125. Springer, 2002.  ISBN 3-540-43977-3.  doi: 10.1007/3-540-45643-0“˙9.  URL https://doi.org/10.1007/3-540-45643-0_9.
  * Cattaneo et al. [2010] Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, and Giuseppe F. Italiano.  Maintaining dynamic minimum spanning trees: An experimental study.  _Discret. Appl. Math._ , 158(5):404–425, 2010\.  doi: 10.1016/j.dam.2009.10.005.  URL https://doi.org/10.1016/j.dam.2009.10.005.
  * Chan and Yang [2009] Edward P. F. Chan and Yaya Yang.  Shortest path tree computation in dynamic graphs.  _IEEE Trans. Computers_ , 58(4):541–557, 2009\.  doi: 10.1109/TC.2008.198.  URL https://doi.org/10.1109/TC.2008.198.
  * Charikar and Solomon [2018] Moses Charikar and Shay Solomon.  Fully dynamic almost-maximal matching: Breaking the polynomial worst-case time barrier.  In Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella, editors, _45th International Colloquium on Automata, Languages, and Programming, ICALP 2018_ , volume 107 of _LIPIcs_ , pages 33:1–33:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.  doi: 10.4230/LIPIcs.ICALP.2018.33.  URL https://doi.org/10.4230/LIPIcs.ICALP.2018.33.
  * Chechik and Zhang [2019] Shiri Chechik and Tianyi Zhang.  Fully dynamic maximal independent set in expected poly-log update time.  In Zuckerman [2019], pages 370–381.  ISBN 978-1-7281-4952-3.  doi: 10.1109/FOCS.2019.00031.  URL https://doi.org/10.1109/FOCS.2019.00031.
  * Chehreghani et al. [2018] Mostafa Haghir Chehreghani, Albert Bifet, and Talel Abdessalem.  Dybed: An efficient algorithm for updating betweenness centrality in directed dynamic graphs.  In Naoki Abe, Huan Liu, Calton Pu, Xiaohua Hu, Nesreen K. Ahmed, Mu Qiao, Yang Song, Donald Kossmann, Bing Liu, Kisung Lee, Jiliang Tang, Jingrui He, and Jeffrey S. Saltz, editors, _IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018_ , pages 2114–2123. IEEE, 2018.  doi: 10.1109/BigData.2018.8622452.  URL https://doi.org/10.1109/BigData.2018.8622452.
  * Chen et al. [2020] Li Chen, Gramoz Goranci, Monika Henzinger, Richard Peng, and Thatchaphol Saranurak.  Fast dynamic cuts, distances and effective resistances via vertex sparsifiers.  pages 1135–1146, 2020.  doi: 10.1109/FOCS46700.2020.00109.  URL https://doi.org/10.1109/FOCS46700.2020.00109.
  * Cohen et al. [2013] Edith Cohen, Amos Fiat, Haim Kaplan, and Liam Roditty.  A labeling approach to incremental cycle detection.  _CoRR_ , abs/1310.8381, 2013.  URL http://arxiv.org/abs/1310.8381.
  * Crescenzi et al. [2020] Pierluigi Crescenzi, Clémence Magnien, and Andrea Marino.  Finding top-k nodes for temporal closeness in large temporal graphs.  _Algorithms_ , 13(9):211, 2020.  doi: 10.3390/a13090211.  URL https://doi.org/10.3390/a13090211.
  * Crouch and Stubbs [2014] Michael Crouch and Daniel S. Stubbs.  Improved streaming algorithms for weighted matching, via unweighted matching.  In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, and Cristopher Moore, editors, _Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain_ , volume 28 of _LIPIcs_ , pages 96–104. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.  ISBN 978-3-939897-74-3.  doi: 10.4230/LIPIcs.APPROX-RANDOM.2014.96.  URL https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.96.
  * Crouch et al. [2013] Michael S Crouch, Andrew McGregor, and Daniel Stubbs.  Dynamic graphs in the sliding-window model.  In _European Symposium on Algorithms_ , pages 337–348. Springer, 2013\.
  * D’Andrea et al. [2015] Annalisa D’Andrea, Mattia D’Emidio, Daniele Frigioni, Stefano Leucci, and Guido Proietti.  Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: New algorithms and experiments.  _ACM J. Exp. Algorithmics_ , 20:1.5:1.1–1.5:1.33, 2015\.  doi: 10.1145/2786022.  URL https://doi.org/10.1145/2786022.
  * D’Angelo et al. [2014] Gianlorenzo D’Angelo, Mattia D’Emidio, and Daniele Frigioni.  Fully dynamic update of arc-flags.  _Networks_ , 63(3):243–259, 2014.  doi: 10.1002/net.21542.  URL https://doi.org/10.1002/net.21542.
  * Delling and Wagner [2007] Daniel Delling and Dorothea Wagner.  Landmark-based routing in dynamic graphs.  In Demetrescu [2007], pages 52–65.  ISBN 978-3-540-72844-3.  doi: 10.1007/978-3-540-72845-0“˙5.  URL https://doi.org/10.1007/978-3-540-72845-0_5.
  * Delling et al. [2011] Daniel Delling, Andrew V. Goldberg, Thomas Pajor, and Renato Fonseca F. Werneck.  Customizable route planning.  In Panos M. Pardalos and Steffen Rebennack, editors, _Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proc._ , volume 6630 of _Lecture Notes in Computer Science_ , pages 376–387. Springer, 2011.  ISBN 978-3-642-20661-0.  doi: 10.1007/978-3-642-20662-7“˙32.  URL https://doi.org/10.1007/978-3-642-20662-7_32.
  * Demetrescu [2001] Camil Demetrescu.  _Fully Dynamic Algorithms for Path Problems on Directed Graphs_.  PhD thesis, 2001.  URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.8921.
  * Demetrescu [2007] Camil Demetrescu, editor.  _Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proc._ , volume 4525 of _Lecture Notes in Computer Science_ , 2007. Springer.  ISBN 978-3-540-72844-3.  doi: 10.1007/978-3-540-72845-0.  URL https://doi.org/10.1007/978-3-540-72845-0.
  * Demetrescu and Italiano [2004] Camil Demetrescu and Giuseppe F. Italiano.  A new approach to dynamic all pairs shortest paths.  _J. ACM_ , 51(6):968–992, 2004.  doi: 10.1145/1039488.1039492.  URL https://doi.org/10.1145/1039488.1039492.
  * Demetrescu and Italiano [2005] Camil Demetrescu and Giuseppe F. Italiano.  Trade-offs for fully dynamic transitive closure on dags: breaking through the o(n${}^{\mbox{2}}$ barrier.  _Journal of the ACM_ , 52(2):147–156, 2005\.  doi: 10.1145/1059513.1059514.  URL https://doi.org/10.1145/1059513.1059514.
  * Demetrescu and Italiano [2006] Camil Demetrescu and Giuseppe F. Italiano.  Experimental analysis of dynamic all pairs shortest path algorithms.  _ACM Trans. Algorithms_ , 2(4):578–601, 2006\.  doi: 10.1145/1198513.1198519.  URL https://doi.org/10.1145/1198513.1198519.
  * Demetrescu and Italiano [2008] Camil Demetrescu and Giuseppe F. Italiano.  Mantaining dynamic matrices for fully dynamic transitive closure.  _Algorithmica_ , 51(4):387–427, 2008.  doi: 10.1007/s00453-007-9051-4.  URL https://doi.org/10.1007/s00453-007-9051-4.
  * Demetrescu et al. [2000] Camil Demetrescu, Daniele Frigioni, Alberto Marchetti-Spaccamela, and Umberto Nanni.  Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study.  In Stefan Näher and Dorothea Wagner, editors, _Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proc._ , volume 1982 of _Lecture Notes in Computer Science_ , pages 218–229. Springer, 2000.  ISBN 3-540-42512-8.  doi: 10.1007/3-540-44691-5“˙19.  URL https://doi.org/10.1007/3-540-44691-5_19.
  * Dhulipala et al. [2020] Laxman Dhulipala, Quanquan C. Liu, and Julian Shun.  Parallel batch-dynamic k-clique counting.  _CoRR_ , abs/2003.13585, 2020.  URL https://arxiv.org/abs/2003.13585.
  * Diesner et al. [2017] Jana Diesner, Elena Ferrari, and Guandong Xu, editors.  _Proc. of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31 - August 03, 2017_ , 2017. ACM.  ISBN 978-1-4503-4993-2.  doi: 10.1145/3110025.  URL https://doi.org/10.1145/3110025.
  * Dijkstra [1959] Edsger W. Dijkstra.  A note on two problems in connexion with graphs.  _Numerische Mathematik_ , 1:269–271, 1959.  doi: 10.1007/BF01386390.  URL https://doi.org/10.1007/BF01386390.
  * Doll et al. [2011] Christof Doll, Tanja Hartmann, and Dorothea Wagner.  Fully-dynamic hierarchical graph clustering using cut trees.  In _12th Intl. Symp. on Algorithms and Data Structures, WADS’11_ , volume 6844 of _LNCS_ , pages 338–349, 2011.  doi: 10.1007/978-3-642-22300-6“˙29.  URL https://doi.org/10.1007/978-3-642-22300-6_29.
  * Ediger et al. [2012] David Ediger, Robert McColl, E. Jason Riedy, and David A. Bader.  STINGER: high performance data structure for streaming graphs.  In _IEEE Conference on High Performance Extreme Computing, HPEC 2012, Waltham, MA, USA, September 10-12, 2012_ , pages 1–5. IEEE, 2012\.  ISBN 978-1-4673-1577-7.  doi: 10.1109/HPEC.2012.6408680.  URL https://doi.org/10.1109/HPEC.2012.6408680.
  * Edmonds and Karp [1972] Jack R. Edmonds and Richard M. Karp.  Theoretical improvements in algorithmic efficiency for network flow problems.  _J. ACM_ , 19(2):248–264, 1972.  doi: 10.1145/321694.321699.  URL https://doi.org/10.1145/321694.321699.
  * Eppstein [1994] David Eppstein.  Offline algorithms for dynamic minimum spanning tree problems.  _Journal of Algorithms_ , 17(2):237–250, 1994\.
  * Eppstein et al. [1996] David Eppstein, Zvi Galil, Giuseppe F. Italiano, and Thomas H. Spencer.  Separator based sparsification. i. planary testing and minimum spanning trees.  _J. Comput. Syst. Sci._ , 52(1):3–27, 1996.  doi: 10.1006/jcss.1996.0002.  URL https://doi.org/10.1006/jcss.1996.0002.
  * Eppstein et al. [1998] David Eppstein, Zvi Galil, Giuseppe F. Italiano, and Thomas H. Spencer.  Separator-based sparsification II: edge and vertex connectivity.  _SIAM J. Comput._ , 28(1):341–381, 1998.  doi: 10.1137/S0097539794269072.  URL https://doi.org/10.1137/S0097539794269072.
  * Fan et al. [2020] Wenfei Fan, Muyang Liu, Chao Tian, Ruiqi Xu, and Jingren Zhou.  Incrementalization of graph partitioning algorithms.  _Proc. VLDB Endow._ , 13(8):1261–1274, 2020\.  doi: 10.14778/3389133.3389142.  URL https://doi.org/10.14778/3389133.3389142.
  * Feng et al. [2015] Guoyao Feng, Xiao Meng, and Khaled Ammar.  Distinger: A distributed graph data structure for massive dynamic graph processing.  In _2015 IEEE International Conference on Big Data (Big Data)_ , pages 1814–1822. IEEE, 2015.  doi: 10.1109/BigData.2015.7363954.  URL https://doi.org/10.1109/BigData.2015.7363954.
  * Frederickson [1985] Greg N. Frederickson.  Data structures for on-line updating of minimum spanning trees, with applications.  _SIAM J. Comput._ , 14(4):781–798, 1985.  doi: 10.1137/0214055.  URL https://doi.org/10.1137/0214055.
  * Frederickson [1997] Greg N. Frederickson.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees.  _SIAM J. Comput._ , 26(2):484–538, 1997.  doi: 10.1137/S0097539792226825.  URL https://doi.org/10.1137/S0097539792226825.
  * Frigioni et al. [1996] Daniele Frigioni, Alberto Marchetti-Spaccamela, and Umberto Nanni.  Fully dynamic output bounded single source shortest path problem (extended abstract).  In Éva Tardos, editor, _Proc. of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 28-30 January 1996, Atlanta, Georgia, USA_ , pages 212–221. ACM/SIAM, 1996.  ISBN 0-89871-366-8.  URL http://dl.acm.org/citation.cfm?id=313852.313926.
  * Frigioni et al. [1998] Daniele Frigioni, Mario Ioffreda, Umberto Nanni, and Giulio Pasqualone.  Experimental analysis of dynamic algorithms for the single-source shortest-path problem.  _ACM J. Exp. Algorithmics_ , 3:5, 1998.  doi: 10.1145/297096.297147.  URL https://doi.org/10.1145/297096.297147.
  * Frigioni et al. [2001] Daniele Frigioni, Tobias Miller, Umberto Nanni, and Christos D. Zaroliagis.  An experimental study of dynamic algorithms for transitive closure.  _ACM J. Exp. Algorithmics_ , 6:9, 2001.  doi: 10.1145/945394.945403.  URL https://doi.org/10.1145/945394.945403.
  * Goldberg and Harrelson [2005] Andrew V. Goldberg and Chris Harrelson.  Computing the shortest path: _A_ search meets graph theory.  In _Proc. of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005_ , pages 156–165. SIAM, 2005.  URL http://dl.acm.org/citation.cfm?id=1070432.1070455.
  * Goldberg and Tarjan [1988] Andrew V. Goldberg and Robert Endre Tarjan.  A new approach to the maximum-flow problem.  _J. ACM_ , 35(4):921–940, 1988.  doi: 10.1145/48014.61051.  URL https://doi.org/10.1145/48014.61051.
  * Goldberg et al. [2015] Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Pushmeet Kohli, Robert Endre Tarjan, and Renato F. Werneck.  Faster and more dynamic maximum flow by incremental breadth-first search.  In Nikhil Bansal and Irene Finocchi, editors, _Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proc._ , volume 9294 of _Lecture Notes in Computer Science_ , pages 619–630. Springer, 2015.  doi: 10.1007/978-3-662-48350-3“˙52.  URL https://doi.org/10.1007/978-3-662-48350-3_52.
  * Goranci et al. [2020] Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak, and Zihan Tan.  The expander hierarchy and its applications to dynamic graph algorithms.  _CoRR_ , abs/2005.02369, 2020.  URL https://arxiv.org/abs/2005.02369.
  * Görke et al. [2010] Robert Görke, Pascal Maillard, Christian Staudt, and Dorothea Wagner.  Modularity-driven clustering of dynamic graphs.  In Paola Festa, editor, _Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010\. Proc._ , volume 6049 of _Lecture Notes in Computer Science_ , pages 436–448. Springer, 2010.  ISBN 978-3-642-13192-9.  doi: 10.1007/978-3-642-13193-6“˙37.  URL https://doi.org/10.1007/978-3-642-13193-6_37.
  * Görke et al. [2012a] Robert Görke, Tanja Hartmann, and Dorothea Wagner.  Dynamic graph clustering using minimum-cut trees.  _J. Graph Algorithms Appl._ , 16(2):411–446, 2012a.  doi: 10.7155/jgaa.00269.  URL https://doi.org/10.7155/jgaa.00269.
  * Görke et al. [2012b] Robert Görke, Roland Kluge, Andrea Schumm, Christian Staudt, and Dorothea Wagner.  An efficient generator for clustered dynamic random networks.  In Guy Even and Dror Rawitz, editors, _Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proc._ , volume 7659 of _Lecture Notes in Computer Science_ , pages 219–233. Springer, 2012b.  doi: 10.1007/978-3-642-34862-4“˙16.  URL https://doi.org/10.1007/978-3-642-34862-4_16.
  * Görke et al. [2013] Robert Görke, Pascal Maillard, Andrea Schumm, Christian Staudt, and Dorothea Wagner.  Dynamic graph clustering combining modularity and smoothness.  _ACM J. Exp. Algorithmics_ , 18, 2013.  doi: 10.1145/2444016.2444021.  URL https://doi.org/10.1145/2444016.2444021.
  * Grandoni et al. [2019] Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, and Shay Solomon.  (1 + $\epsilon$)-approximate incremental matching in constant deterministic amortized time.  In _Proc. of the 20th Symposium on Discrete Algorithms_ DBL [2019], pages 1886–1898.  ISBN 978-1-61197-548-2.  doi: 10.1137/1.9781611975482.114.  URL https://doi.org/10.1137/1.9781611975482.114.
  * Grandoni et al. [2020] Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors.  _28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)_ , volume 173 of _LIPIcs_ , 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.  ISBN 978-3-95977-162-7.
  * Greco et al. [2017] Sergio Greco, Cristian Molinaro, Chiara Pulice, and Ximena Quintana.  Incremental maximum flow computation on evolving networks.  In Ahmed Seffah, Birgit Penzenstadler, Carina Alves, and Xin Peng, editors, _Proc. of the Symposium on Applied Computing, SAC 2017, Marrakech, Morocco, April 3-7, 2017_ , pages 1061–1067. ACM, 2017.  doi: 10.1145/3019612.3019816.  URL https://doi.org/10.1145/3019612.3019816.
  * Green et al. [2012] Oded Green, Robert McColl, and David A. Bader.  A fast algorithm for streaming betweenness centrality.  In _2012 International Conference on Privacy, Security, Risk and Trust, PASSAT 2012, and 2012 International Confernece on Social Computing, SocialCom 2012, Amsterdam, Netherlands, September 3-5, 2012_ , pages 11–20. IEEE Computer Society, 2012.  ISBN 978-1-4673-5638-1.  doi: 10.1109/SocialCom-PASSAT.2012.37.  URL https://doi.org/10.1109/SocialCom-PASSAT.2012.37.
  * Guibas [2004] Leonidas J. Guibas.  Kinetic data structures.  In Dinesh P. Mehta and Sartaj Sahni, editors, _Handbook of Data Structures and Applications_. Chapman and Hall/CRC, 2004.  doi: 10.1201/9781420035179.ch23.  URL https://doi.org/10.1201/9781420035179.ch23.
  * Gupta and Khan [to appear, 2021] Manoj Gupta and Shahbaz Khan.  Simple dynamic algorithms for maximal independent set and other problems.  In _4th Symposium on Simplicity in Algorithms, SOSA@SODA 2021_ , to appear, 2021.  URL http://arxiv.org/abs/1804.01823.
  * Gupta and Peng [2013a] Manoj Gupta and Richard Peng.  Fully dynamic (1+ e)-approximate matchings.  In _54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA_ , pages 548–557. IEEE Computer Society, 2013a.  doi: 10.1109/FOCS.2013.65.  URL https://doi.org/10.1109/FOCS.2013.65.
  * Gupta and Peng [2013b] Manoj Gupta and Richard Peng.  Fully dynamic (1+ e)-approximate matchings.  In _54th Symposium on Foundations of Computer Science, FOCS_ , pages 548–557. IEEE Computer Society, 2013b.  ISBN 978-0-7695-5135-7.  doi: 10.1109/FOCS.2013.65.  URL https://doi.org/10.1109/FOCS.2013.65.
  * Haeupler et al. [2012] Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, and Robert Endre Tarjan.  Incremental cycle detection, topological ordering, and strong component maintenance.  _ACM Trans. Algorithms_ , 8(1):3:1–3:33, 2012\.  doi: 10.1145/2071379.2071382.  URL https://doi.org/10.1145/2071379.2071382.
  * Han and Sethu [2017] Guyue Han and Harish Sethu.  Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs.  In Diesner et al. [2017], pages 44–49.  ISBN 978-1-4503-4993-2.  doi: 10.1145/3110025.3110061.  URL https://doi.org/10.1145/3110025.3110061.
  * Hanauer et al. [2020a] Kathrin Hanauer, Monika Henzinger, and Christian Schulz.  Fully dynamic single-source reachability in practice: An experimental study.  In Guy E. Blelloch and Irene Finocchi, editors, _Proc. of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020_ , pages 106–119. SIAM, 2020a.  doi: 10.1137/1.9781611976007.9.  URL https://doi.org/10.1137/1.9781611976007.9.
  * Hanauer et al. [2020b] Kathrin Hanauer, Monika Henzinger, and Christian Schulz.  Faster fully dynamic transitive closure in practice.  In Simone Faro and Domenico Cantone, editors, _18th International Symposium on Experimental Algorithms, SEA 2020, June 16-18, 2020, Catania, Italy_ , volume 160 of _LIPIcs_ , pages 14:1–14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020b.  doi: 10.4230/LIPIcs.SEA.2020.14.  URL https://doi.org/10.4230/LIPIcs.SEA.2020.14.
  * Hayashi et al. [2015] Takanori Hayashi, Takuya Akiba, and Yuichi Yoshida.  Fully dynamic betweenness centrality maintenance on massive networks.  _Proc. VLDB Endow._ , 9(2):48–59, 2015.  doi: 10.14778/2850578.2850580.  URL http://www.vldb.org/pvldb/vol9/p48-hayashi.pdf.
  * Henderson and Eliassi-Rad [2009] Keith Henderson and Tina Eliassi-Rad.  Applying latent dirichlet allocation to group discovery in large graphs.  In Sung Y. Shin and Sascha Ossowski, editors, _Proc. of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009_ , pages 1456–1461. ACM, 2009.  ISBN 978-1-60558-166-8.  doi: 10.1145/1529282.1529607.  URL https://doi.org/10.1145/1529282.1529607.
  * Hendrickson et al. [1996] Bruce Hendrickson, Robert W. Leland, and Rafael Van Driessche.  Enhancing data locality by using terminal propagation.  In _29th Annual Hawaii International Conference on System Sciences (HICSS-29), January 3-6, 1996, Maui, Hawaii, USA_ , pages 565–574. IEEE Computer Society, 1996.  ISBN 0-8186-7324-9.  doi: 10.1109/HICSS.1996.495507.  URL https://doi.org/10.1109/HICSS.1996.495507.
  * Henzinger [2018] Monika Henzinger.  The state of the art in dynamic graph algorithms.  In _44th Intl. Conf. on Current Trends in Theory and Practice of Computer Science, SOFSEM’18_ , volume 10706 of _LNCS_ , pages 40–44. Springer, 2018.  doi: 10.1007/978-3-319-73117-9“˙3.  URL https://doi.org/10.1007/978-3-319-73117-9_3.
  * Henzinger et al. [2015] Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol Saranurak.  Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture.  In _Proc. of the forty-seventh annual ACM symposium on Theory of computing_ , pages 21–30, 2015.  doi: 10.1145/2746539.2746609.  URL https://doi.org/10.1145/2746539.2746609.
  * Henzinger et al. [2017] Monika Henzinger, Andrea Lincoln, Stefan Neumann, and Virginia Vassilevska Williams.  Conditional hardness for sensitivity problems.  In Christos H. Papadimitriou, editor, _8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA_ , volume 67 of _LIPIcs_ , pages 26:1–26:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.  doi: 10.4230/LIPIcs.ITCS.2017.26.  URL https://doi.org/10.4230/LIPIcs.ITCS.2017.26.
  * Henzinger et al. [2020] Monika Henzinger, Shahbaz Khan, Richard Paul, and Christian Schulz.  Dynamic matching algorithms in practice.  In Grandoni et al. [2020], pages 58:1–58:20.  ISBN 978-3-95977-162-7.  doi: 10.4230/LIPIcs.ESA.2020.58.  URL https://doi.org/10.4230/LIPIcs.ESA.2020.58.
  * Henzinger and King [1997] Monika R Henzinger and Valerie King.  Maintaining minimum spanning trees in dynamic graphs.  In _International Colloquium on Automata, Languages, and Programming_ , pages 594–604. Springer, 1997.
  * Henzinger [1995] Monika Rauch Henzinger.  Fully dynamic biconnectivity in graphs.  _Algorithmica_ , 13(6):503–538, 1995.  doi: 10.1007/BF01189067.  URL https://doi.org/10.1007/BF01189067.
  * Henzinger [2000] Monika Rauch Henzinger.  Improved data structures for fully dynamic biconnectivity.  _SIAM J. Comput._ , 29(6):1761–1815, 2000.  doi: 10.1137/S0097539794263907.  URL https://doi.org/10.1137/S0097539794263907.
  * Henzinger and Fredman [1998] Monika Rauch Henzinger and Michael L. Fredman.  Lower bounds for fully dynamic connectivity problems in graphs.  _Algorithmica_ , 22(3):351–362, 1998.  doi: 10.1007/PL00009228.  URL https://doi.org/10.1007/PL00009228.
  * Henzinger and King [1995a] Monika Rauch Henzinger and Valerie King.  Fully dynamic biconnectivity and transitive closure.  In _36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995_ , pages 664–672. IEEE Computer Society, 1995a.  doi: 10.1109/SFCS.1995.492668.  URL https://doi.org/10.1109/SFCS.1995.492668.
  * Henzinger and King [1995b] Monika Rauch Henzinger and Valerie King.  Randomized dynamic graph algorithms with polylogarithmic time per operation.  In Frank Thomson Leighton and Allan Borodin, editors, _Proc. of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA_ , pages 519–527. ACM, 1995b.  doi: 10.1145/225058.225269.  URL https://doi.org/10.1145/225058.225269.
  * Henzinger and King [1999] Monika Rauch Henzinger and Valerie King.  Randomized fully dynamic graph algorithms with polylogarithmic time per operation.  _J. ACM_ , 46(4):502–516, 1999.  doi: 10.1145/320211.320215.  URL https://doi.org/10.1145/320211.320215.
  * Holm et al. [1998] Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.  In Jeffrey Scott Vitter, editor, _Proc. of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998_ , pages 79–89. ACM, 1998.  doi: 10.1145/276698.276715.  URL https://doi.org/10.1145/276698.276715.
  * Holm et al. [2001] Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.  _J. ACM_ , 48(4):723–760, 2001.  doi: 10.1145/502090.502095.  URL https://doi.org/10.1145/502090.502095.
  * Holm et al. [2015] Jacob Holm, Eva Rotenberg, and Christian Wulff-Nilsen.  Faster fully-dynamic minimum spanning forest.  In Nikhil Bansal and Irene Finocchi, editors, _Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proc._ , volume 9294 of _Lecture Notes in Computer Science_ , pages 742–753. Springer, 2015.  doi: 10.1007/978-3-662-48350-3“˙62.  URL https://doi.org/10.1007/978-3-662-48350-3_62.
  * Hu and Blake [1999] Y.F. Hu and R.J. Blake.  An improved diffusion algorithm for dynamic load balancing.  _Parallel Computing_ , 25(4):417 – 444, 1999\.  ISSN 0167-8191.  doi: https://doi.org/10.1016/S0167-8191(99)00002-2.  URL http://www.sciencedirect.com/science/article/pii/S0167819199000022.
  * Hua et al. [2020] Qiang-Sheng Hua, Yuliang Shi, Dongxiao Yu, Hai Jin, Jiguo Yu, Zhipeng Cai, Xiuzhen Cheng, and Hanhua Chen.  Faster parallel core maintenance algorithms in dynamic graphs.  _IEEE Trans. Parallel Distributed Syst._ , 31(6):1287–1300, 2020.  doi: 10.1109/TPDS.2019.2960226.  URL https://doi.org/10.1109/TPDS.2019.2960226.
  * Huang and Abadi [2016] Jiewen Huang and Daniel Abadi.  LEOPARD: lightweight edge-oriented partitioning and replication for dynamic graphs.  _Proc. VLDB Endow._ , 9(7):540–551, 2016.  doi: 10.14778/2904483.2904486.  URL http://www.vldb.org/pvldb/vol9/p540-huang.pdf.
  * Huang et al. [2017] Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, and Seth Pettie.  Fully dynamic connectivity in _O_(log _n_(log log _n_)${}^{\mbox{2}}$) amortized expected time.  In Philip N. Klein, editor, _Proc. of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19_ , pages 510–520. SIAM, 2017.  doi: 10.1137/1.9781611974782.32.  URL https://doi.org/10.1137/1.9781611974782.32.
  * Huo [2013] Wenyu Huo.  _Query Processing on Temporally Evolving Social Data_.  PhD thesis, University of California, Riverside, USA, 2013.  URL http://www.escholarship.org/uc/item/7t78t5r4.
  * Huo and Tsotras [2014] Wenyu Huo and Vassilis J. Tsotras.  Efficient temporal shortest path queries on evolving social graphs.  In Christian S. Jensen, Hua Lu, Torben Bach Pedersen, Christian Thomsen, and Kristian Torp, editors, _Conference on Scientific and Statistical Database Management, SSDBM ’14, Aalborg, Denmark, June 30 - July 02, 2014_ , pages 38:1–38:4. ACM, 2014.  ISBN 978-1-4503-2722-0.  doi: 10.1145/2618243.2618282.  URL https://doi.org/10.1145/2618243.2618282.
  * Ibaraki and Katoh [1983] T. Ibaraki and N. Katoh.  On-line computation of transitive closures of graphs.  _Information Processing Letters_ , 16(2):95 – 97, 1983.  ISSN 0020-0190.  doi: https://doi.org/10.1016/0020-0190(83)90033-9.  URL http://www.sciencedirect.com/science/article/pii/0020019083900339.
  * II et al. [1997] Giuseppe Amato II, Giuseppe Cattaneo, and Giuseppe F. Italiano.  Experimental analysis of dynamic minimum spanning tree algorithms (extended abstract).  In Michael E. Saks, editor, _Proc. of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA_ , pages 314–323. ACM/SIAM, 1997.  ISBN 0-89871-390-0.  URL http://dl.acm.org/citation.cfm?id=314161.314314.
  * Italiano [1986] Giuseppe F. Italiano.  Amortized efficiency of a path retrieval data structure.  _Theor. Comput. Sci._ , 48(3):273–281, 1986.  doi: 10.1016/0304-3975(86)90098-8.  URL https://doi.org/10.1016/0304-3975(86)90098-8.
  * Italiano [1988] Giuseppe F. Italiano.  Finding paths and deleting edges in directed acyclic graphs.  _Information Processing Letters_ , 28(1):5–11, 1988.  doi: 10.1016/0020-0190(88)90136-6.  URL https://doi.org/10.1016/0020-0190(88)90136-6.
  * Italiano [2016] Giuseppe F. Italiano.  Fully dynamic higher connectivity.  In _Encyclopedia of Algorithms_ , pages 797–800. 2016.  doi: 10.1007/978-1-4939-2864-4“˙154.  URL https://doi.org/10.1007/978-1-4939-2864-4_154.
  * Ivkovic and Lloyd [1993] Zoran Ivkovic and Errol L. Lloyd.  Fully dynamic maintenance of vertex cover.  In _19th International Workshop Graph-Theoretic Concepts in Computer Science_ , volume 790 of _LNCS_ , pages 99–111, 1993.
  * Iwabuchi et al. [2016] Keita Iwabuchi, Scott Sallinen, Roger Pearce, Brian Van Essen, Maya Gokhale, and Satoshi Matsuoka.  Towards a distributed large-scale dynamic graph data store.  In _2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)_ , pages 892–901. IEEE, 2016.  doi: 10.1109/IPDPSW.2016.189.  URL https://doi.org/10.1109/IPDPSW.2016.189.
  * Iyer et al. [2001] Raj Iyer, David R. Karger, Hariharan Rahul, and Mikkel Thorup.  An experimental study of polylogarithmic, fully dynamic, connectivity algorithms.  _ACM J. Exp. Algorithmics_ , 6:4, 2001.  doi: 10.1145/945394.945398.  URL https://doi.org/10.1145/945394.945398.
  * Jin et al. [2018] Hai Jin, Na Wang, Dongxiao Yu, Qiang-Sheng Hua, Xuanhua Shi, and Xia Xie.  Core maintenance in dynamic graphs: A parallel approach based on matching.  _IEEE Trans. Parallel Distributed Syst._ , 29(11):2416–2428, 2018.  doi: 10.1109/TPDS.2018.2835441.  URL https://doi.org/10.1109/TPDS.2018.2835441.
  * Jin and Sun [2020] Wenyu Jin and Xiaorui Sun.  Fully dynamic c-edge connectivity in subpolynomial time.  _CoRR_ , abs/2004.07650, 2020.  URL https://arxiv.org/abs/2004.07650.
  * Jowhari and Ghodsi [2005] Hossein Jowhari and Mohammad Ghodsi.  New streaming algorithms for counting triangles in graphs.  In Lusheng Wang, editor, _Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proc._ , volume 3595 of _Lecture Notes in Computer Science_ , pages 710–716. Springer, 2005.  ISBN 3-540-28061-8.  doi: 10.1007/11533719“˙72.  URL https://doi.org/10.1007/11533719_72.
  * Kapron et al. [2013] Bruce M. Kapron, Valerie King, and Ben Mountjoy.  Dynamic graph connectivity in polylogarithmic worst case time.  In Sanjeev Khanna, editor, _Proc. of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013_ , pages 1131–1142. SIAM, 2013.  doi: 10.1137/1.9781611973105.81.  URL https://doi.org/10.1137/1.9781611973105.81.
  * Kara et al. [2019] Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang.  Counting triangles under updates in worst-case optimal time.  In Pablo Barceló and Marco Calautti, editors, _22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal_ , volume 127 of _LIPIcs_ , pages 4:1–4:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.  doi: 10.4230/LIPIcs.ICDT.2019.4.  URL https://doi.org/10.4230/LIPIcs.ICDT.2019.4.
  * Kara et al. [2020] Ahmet Kara, Hung Q. Ngo, Milos Nikolic, Dan Olteanu, and Haozhe Zhang.  Maintaining triangle queries under updates.  _ACM Trans. Database Syst._ , 45(3):11:1–11:46, 2020.  doi: 10.1145/3396375.  URL https://doi.org/10.1145/3396375.
  * Kas et al. [2013a] Miray Kas, Kathleen M. Carley, and L. Richard Carley.  Incremental closeness centrality for dynamically changing social networks.  In Rokne and Faloutsos [2013], pages 1250–1258.  ISBN 978-1-4503-2240-9.  doi: 10.1145/2492517.2500270.  URL https://doi.org/10.1145/2492517.2500270.
  * Kas et al. [2013b] Miray Kas, Matthew Wachs, Kathleen M. Carley, and L. Richard Carley.  Incremental algorithm for updating betweenness centrality in dynamically growing networks.  In Rokne and Faloutsos [2013], pages 33–40.  ISBN 978-1-4503-2240-9.  doi: 10.1145/2492517.2492533.  URL https://doi.org/10.1145/2492517.2492533.
  * Katriel and Bodlaender [2006] Irit Katriel and Hans L. Bodlaender.  Online topological ordering.  _ACM Trans. Algorithms_ , 2(3):364–379, 2006\.  doi: 10.1145/1159892.1159896.  URL https://doi.org/10.1145/1159892.1159896.
  * Kavitha and Mathew [2007] Telikepalli Kavitha and Rogers Mathew.  Faster algorithms for online topological ordering.  _CoRR_ , abs/0711.0251, 2007.  URL http://arxiv.org/abs/0711.0251.
  * Kiefer et al. [2016] Tim Kiefer, Dirk Habich, and Wolfgang Lehner.  Penalized graph partitioning for static and dynamic load balancing.  In Pierre-François Dutot and Denis Trystram, editors, _Euro-Par 2016: Parallel Processing - 22nd International Conference on Parallel and Distributed Computing, Grenoble, France, August 24-26, 2016, Proc._ , volume 9833 of _Lecture Notes in Computer Science_ , pages 146–158. Springer, 2016.  ISBN 978-3-319-43658-6.  doi: 10.1007/978-3-319-43659-3“˙11.  URL https://doi.org/10.1007/978-3-319-43659-3_11.
  * King [1999] Valerie King.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs.  In _40th Annual Symposium on Foundations of Computer Science, FOCS ’99, 17-18 October, 1999, New York, NY, USA_ , pages 81–91. IEEE Computer Society, 1999.  ISBN 0-7695-0409-4.  doi: 10.1109/SFFCS.1999.814580.  URL https://doi.org/10.1109/SFFCS.1999.814580.
  * King and Sagert [2002] Valerie King and Garry Sagert.  A fully dynamic algorithm for maintaining the transitive closure.  _J. Comput. Syst. Sci._ , 65(1):150–167, 2002\.  doi: 10.1006/jcss.2002.1883.  URL https://doi.org/10.1006/jcss.2002.1883.
  * King and Thorup [2001] Valerie King and Mikkel Thorup.  A space saving trick for directed dynamic transitive closure and shortest path algorithms.  In Jie Wang, editor, _Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proc._ , volume 2108 of _Lecture Notes in Computer Science_ , pages 268–277. Springer, 2001.  doi: 10.1007/3-540-44679-6“˙30.  URL https://doi.org/10.1007/3-540-44679-6_30.
  * Kohli and Torr [2007] Pushmeet Kohli and Philip H. S. Torr.  Dynamic graph cuts for efficient inference in markov random fields.  _IEEE Trans. Pattern Anal. Mach. Intell._ , 29(12):2079–2088, 2007.  doi: 10.1109/TPAMI.2007.1128.  URL https://doi.org/10.1109/TPAMI.2007.1128.
  * Kohli and Torr [2010] Pushmeet Kohli and Philip H. S. Torr.  Dynamic graph cuts and their applications in computer vision.  In Roberto Cipolla, Sebastiano Battiato, and Giovanni Maria Farinella, editors, _Computer Vision: Detection, Recognition and Reconstruction_ , volume 285 of _Studies in Computational Intelligence_ , pages 51–108. Springer, 2010.  doi: 10.1007/978-3-642-12848-6“˙3.  URL https://doi.org/10.1007/978-3-642-12848-6_3.
  * Kourtellis et al. [2015] Nicolas Kourtellis, Gianmarco De Francisci Morales, and Francesco Bonchi.  Scalable online betweenness centrality in evolving graphs.  _IEEE Trans. Knowl. Data Eng._ , 27(9):2494–2506, 2015.  doi: 10.1109/TKDE.2015.2419666.  URL https://doi.org/10.1109/TKDE.2015.2419666.
  * Kourtellis et al. [2016] Nicolas Kourtellis, Gianmarco De Francisci Morales, and Francesco Bonchi.  Scalable online betweenness centrality in evolving graphs.  In _32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, May 16-20, 2016_ , pages 1580–1581. IEEE Computer Society, 2016.  ISBN 978-1-5090-2020-1.  doi: 10.1109/ICDE.2016.7498421.  URL https://doi.org/10.1109/ICDE.2016.7498421.
  * Krommidas and Zaroliagis [2008] Ioannis Krommidas and Christos D. Zaroliagis.  An experimental study of algorithms for fully dynamic transitive closure.  _ACM J. Exp. Algorithmics_ , 12:1.6:1–1.6:22, 2008.  doi: 10.1145/1227161.1370597.  URL https://doi.org/10.1145/1227161.1370597.
  * Kumar and Gupta [2003] S. Kumar and P. Gupta.  An incremental algorithm for the maximum flow problem.  _J. Math. Model. Algorithms_ , 2(1):1–16, 2003\.  doi: 10.1023/A:1023607406540.  URL https://doi.org/10.1023/A:1023607406540.
  * La Poutré and van Leeuwen [1988] J. A. La Poutré and J. van Leeuwen.  Maintenance of transitive closures and transitive reductions of graphs.  In Herbert Göttler and Hana-Jürgen Schneider, editors, _Graph-Theoretic Concepts in Computer Science_ , pages 106–120, Berlin, Heidelberg, 1988. Springer Berlin Heidelberg.  ISBN 978-3-540-39264-4.
  * Lee et al. [2012] Min-Joong Lee, Jungmin Lee, Jaimie Yejean Park, Ryan Hyun Choi, and Chin-Wan Chung.  QUBE: a quick algorithm for updating betweenness centrality.  In Alain Mille, Fabien L. Gandon, Jacques Misselis, Michael Rabinovich, and Steffen Staab, editors, _Proc. of the 21st World Wide Web Conference 2012, WWW 2012, Lyon, France, April 16-20, 2012_ , pages 351–360. ACM, 2012.  ISBN 978-1-4503-1229-5.  doi: 10.1145/2187836.2187884.  URL https://doi.org/10.1145/2187836.2187884.
  * Lee et al. [2016] Min-Joong Lee, Sunghee Choi, and Chin-Wan Chung.  Efficient algorithms for updating betweenness centrality in fully dynamic graphs.  _Inf. Sci._ , 326:278–296, 2016.  doi: 10.1016/j.ins.2015.07.053.  URL https://doi.org/10.1016/j.ins.2015.07.053.
  * Li et al. [2014] Rong-Hua Li, Jeffrey Xu Yu, and Rui Mao.  Efficient core maintenance in large dynamic graphs.  _IEEE Trans. Knowl. Data Eng._ , 26(10):2453–2465, 2014.  doi: 10.1109/TKDE.2013.158.  URL https://doi.org/10.1109/TKDE.2013.158.
  * Lim and Kang [2015] Yongsub Lim and U Kang.  MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams.  In Longbing Cao, Chengqi Zhang, Thorsten Joachims, Geoffrey I. Webb, Dragos D. Margineantu, and Graham Williams, editors, _Proc. of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10-13, 2015_ , pages 685–694. ACM, 2015\.  ISBN 978-1-4503-3664-2.  doi: 10.1145/2783258.2783285.  URL https://doi.org/10.1145/2783258.2783285.
  * Lim et al. [2018] Yongsub Lim, Minsoo Jung, and U Kang.  Memory-efficient and accurate sampling for counting local triangles in graph streams: From simple to multigraphs.  _ACM Trans. Knowl. Discov. Data_ , 12(1):4:1–4:28, 2018.  doi: 10.1145/3022186.  URL https://doi.org/10.1145/3022186.
  * Liu et al. [2019] Paul Liu, Austin R. Benson, and Moses Charikar.  Sampling methods for counting temporal motifs.  In J. Shane Culpepper, Alistair Moffat, Paul N. Bennett, and Kristina Lerman, editors, _Proc. of the Twelfth ACM International Conference on Web Search and Data Mining, WSDM 2019, Melbourne, VIC, Australia, February 11-15, 2019_ , pages 294–302. ACM, 2019.  ISBN 978-1-4503-5940-5.  doi: 10.1145/3289600.3290988.  URL https://doi.org/10.1145/3289600.3290988.
  * Łacki [2011] Jakub Łacki.  Improved deterministic algorithms for decremental transitive closure and strongly connected components.  In Dana Randall, editor, _Proc. of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011_ , pages 1438–1445. SIAM, 2011.  doi: 10.1137/1.9781611973082.111.  URL https://doi.org/10.1137/1.9781611973082.111.
  * Makkar et al. [2017] Devavret Makkar, David A. Bader, and Oded Green.  Exact and parallel triangle counting in dynamic graphs.  In _24th IEEE International Conference on High Performance Computing, HiPC 2017, Jaipur, India, December 18-21, 2017_ , pages 2–12. IEEE Computer Society, 2017.  doi: 10.1109/HiPC.2017.00011.  URL https://doi.org/10.1109/HiPC.2017.00011.
  * Marchetti-Spaccamela et al. [1996] Alberto Marchetti-Spaccamela, Umberto Nanni, and Hans Rohnert.  Maintaining a topological order under edge insertions.  _Inf. Process. Lett._ , 59(1):53–58, 1996.  doi: 10.1016/0020-0190(96)00075-0.  URL https://doi.org/10.1016/0020-0190(96)00075-0.
  * Meyerhenke [2009] Henning Meyerhenke.  Dynamic load balancing for parallel numerical simulations based on repartitioning with disturbed diffusion.  In _15th International Conference on Parallel and Distributed Systems_ , pages 150–157. IEEE, 2009.  doi: 10.1109/ICPADS.2009.114.  URL https://doi.org/10.1109/ICPADS.2009.114.
  * Meyerhenke and Gehweiler [2010] Henning Meyerhenke and Joachim Gehweiler.  On dynamic graph partitioning and graph clustering using diffusion.  In Giuseppe F. Italiano, David S. Johnson, Petra Mutzel, and Peter Sanders, editors, _Algorithm Engineering, 27.06. - 02.07.2010_ , volume 10261 of _Dagstuhl Seminar Proc._ Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2010.  URL http://drops.dagstuhl.de/opus/volltexte/2010/2798/.
  * Miller and Eliassi-Rad [2009] Kurt T Miller and Tina Eliassi-Rad.  Continuous time group discovery in dynamic graphs.  In _Notes of the 2009 NIPS Workshop on Analyzing Networks and Learning with Graphs, Whistler, BC, Canada_ , 2009.
  * Miltersen et al. [1994] Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, and Roberto Tamassia.  Complexity models for incremental computation.  _Theor. Comput. Sci._ , 130(1):203–236, 1994\.  doi: 10.1016/0304-3975(94)90159-7.  URL https://doi.org/10.1016/0304-3975(94)90159-7.
  * Miorandi and Pellegrini [2010] Daniele Miorandi and Francesco De Pellegrini.  K-shell decomposition for dynamic complex networks.  In _8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31 - June 4, 2010, University of Avignon, Avignon, France_ DBL [2010], pages 488–496.  ISBN 978-1-4244-7523-0.  URL http://ieeexplore.ieee.org/document/5520231/.
  * Mukherjee et al. [2018] Kingshuk Mukherjee, Md Mahmudul Hasan, Christina Boucher, and Tamer Kahveci.  Counting motifs in dynamic networks.  _BMC Syst. Biol._ , 12(1):1–12, 2018.  doi: 10.1186/s12918-018-0533-6.  URL https://doi.org/10.1186/s12918-018-0533-6.
  * Narváez et al. [2000] Paolo Narváez, Kai-Yeung Siu, and Hong-Yi Tzeng.  New dynamic algorithms for shortest path tree computation.  _IEEE/ACM Trans. Netw._ , 8(6):734–746, 2000\.  doi: 10.1109/90.893870.  URL https://doi.org/10.1109/90.893870.
  * Narváez et al. [2001] Paolo Narváez, Kai-Yeung Siu, and Hong-Yi Tzeng.  New dynamic SPT algorithm based on a ball-and-string model.  _IEEE/ACM Trans. Netw._ , 9(6):706–718, 2001\.  doi: 10.1109/90.974525.  URL https://doi.org/10.1109/90.974525.
  * Nathan and Bader [2017a] Eisha Nathan and David A. Bader.  A dynamic algorithm for updating katz centrality in graphs.  In Diesner et al. [2017], pages 149–154.  ISBN 978-1-4503-4993-2.  doi: 10.1145/3110025.3110034.  URL https://doi.org/10.1145/3110025.3110034.
  * Nathan and Bader [2017b] Eisha Nathan and David A. Bader.  Approximating personalized katz centrality in dynamic graphs.  In Roman Wyrzykowski, Jack J. Dongarra, Ewa Deelman, and Konrad Karczewski, editors, _Parallel Processing and Applied Mathematics - 12th International Conference, PPAM 2017, Lublin, Poland, September 10-13, 2017, Revised Selected Papers, Part I_ , volume 10777 of _Lecture Notes in Computer Science_ , pages 290–302. Springer, 2017b.  ISBN 978-3-319-78023-8.  doi: 10.1007/978-3-319-78024-5“˙26.  URL https://doi.org/10.1007/978-3-319-78024-5_26.
  * Neiman and Solomon [2016] Ofer Neiman and Shay Solomon.  Simple deterministic algorithms for fully dynamic maximal matching.  _ACM Trans. Algorithms_ , 12(1):7:1–7:15, 2016\.  doi: 10.1145/2700206.  URL https://doi.org/10.1145/2700206.
  * Newman and Girvan [2004] M. EJ Newman and M. Girvan.  Finding and Evaluating Community Structure in Networks.  _Physical review E_ , 69(2):026113, 2004.  doi: 10.1103/PhysRevE.69.026113.  URL https://doi.org/10.1103/PhysRevE.69.026113.
  * Nicoara et al. [2015] Daniel Nicoara, Shahin Kamali, Khuzaima Daudjee, and Lei Chen.  Hermes: Dynamic partitioning for distributed social network graph databases.  In _EDBT_ , pages 25–36, 2015.  doi: 10.5441/002/edbt.2015.04.  URL https://doi.org/10.5441/002/edbt.2015.04.
  * Onak and Rubinfeld [2010] Krzysztof Onak and Ronitt Rubinfeld.  Maintaining a large matching and a small vertex cover.  In _STOC_ , pages 457–464, 2010.  doi: 10.1145/1806689.1806753.  URL https://doi.org/10.1145/1806689.1806753.
  * Orlin [2013] James B. Orlin.  Max flows in o(nm) time, or better.  In Dan Boneh, Tim Roughgarden, and Joan Feigenbaum, editors, _Symposium on Theory of Computing Conference, STOC’13, Palo Alto, CA, USA, June 1-4, 2013_ , pages 765–774. ACM, 2013.  doi: 10.1145/2488608.2488705.  URL https://doi.org/10.1145/2488608.2488705.
  * Patrascu [2010] Mihai Patrascu.  Towards polynomial lower bounds for dynamic problems.  In _Proc. of the 42nd ACM Symposium on Theory of Computing, STOC_ , pages 603–610. ACM, 2010.  doi: 10.1145/1806689.1806772.  URL https://doi.org/10.1145/1806689.1806772.
  * Patrascu and Demaine [2006] Mihai Patrascu and Erik D. Demaine.  Logarithmic lower bounds in the cell-probe model.  _SIAM J. Comput._ , 35(4):932–963, 2006.  doi: 10.1137/S0097539705447256.  URL https://doi.org/10.1137/S0097539705447256.
  * Patrascu and Thorup [2007] Mihai Patrascu and Mikkel Thorup.  Planning for fast connectivity updates.  In _48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07)_ , pages 263–271. IEEE, 2007.
  * Pavan et al. [2013] A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu.  Counting and sampling triangles from a graph stream.  _Proc. VLDB Endow._ , 6(14):1870–1881, 2013\.  doi: 10.14778/2556549.2556569.  URL http://www.vldb.org/pvldb/vol6/p1870-aduri.pdf.
  * Pearce and Kelly [2010] D. Pearce and P. Kelly.  A batch algorithm for maintaining a topological order.  In _ACSC_ , 2010.  doi: 10.5555/1862199.1862208.  URL https://dl.acm.org/doi/pdf/10.5555/1862199.1862208.
  * Pearce and Kelly [2004] David J. Pearce and Paul H. J. Kelly.  A dynamic algorithm for topologically sorting directed acyclic graphs.  In Celso C. Ribeiro and Simone L. Martins, editors, _Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proc._ , volume 3059 of _Lecture Notes in Computer Science_ , pages 383–398. Springer, 2004.  ISBN 3-540-22067-4.  doi: 10.1007/978-3-540-24838-5“˙29.  URL https://doi.org/10.1007/978-3-540-24838-5_29.
  * Pearce and Kelly [2006] David J. Pearce and Paul H. J. Kelly.  A dynamic topological sort algorithm for directed acyclic graphs.  _ACM J. Exp. Algorithmics_ , 11, 2006.  doi: 10.1145/1187436.1210590.  URL https://doi.org/10.1145/1187436.1210590.
  * Pearce et al. [2004] David J. Pearce, Paul H. J. Kelly, and Chris Hankin.  Online cycle detection and difference propagation: Applications to pointer analysis.  _Softw. Qual. J._ , 12(4):311–337, 2004.  doi: 10.1023/B:SQJO.0000039791.93071.a2.  URL https://doi.org/10.1023/B:SQJO.0000039791.93071.a2.
  * Pons [2018] Reynaldo Gil Pons.  Space efficient incremental betweenness algorithm for directed graphs.  In Rubén Vera-Rodríguez, Julian Fiérrez, and Aythami Morales, editors, _Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 23rd Iberoamerican Congress, CIARP 2018, Madrid, Spain, November 19-22, 2018, Proc._ , volume 11401 of _Lecture Notes in Computer Science_ , pages 262–270. Springer, 2018.  ISBN 978-3-030-13468-6.  doi: 10.1007/978-3-030-13469-3“˙31.  URL https://doi.org/10.1007/978-3-030-13469-3_31.
  * Putman et al. [2019] K. (Lynn) Putman, Hanjo D. Boekhout, and Frank W. Takes.  Fast incremental computation of harmonic closeness centrality in directed weighted networks.  In Francesca Spezzano, Wei Chen, and Xiaokui Xiao, editors, _ASONAM ’19: International Conference on Advances in Social Networks Analysis and Mining, Vancouver, British Columbia, Canada, 27-30 August, 2019_ , pages 1018–1025. ACM, 2019.  ISBN 978-1-4503-6868-1.  doi: 10.1145/3341161.3344829.  URL https://doi.org/10.1145/3341161.3344829.
  * Ramalingam and Reps [1991] G Ramalingam and Thomas Reps.  On the computational complexity of incremental algorithms.  Technical report, University of Wisconsin-Madison Department of Computer Sciences, 1991.
  * Ramalingam and Reps [1996a] G. Ramalingam and Thomas W. Reps.  An incremental algorithm for a generalization of the shortest-path problem.  _J. Algorithms_ , 21(2):267–305, 1996a.  doi: 10.1006/jagm.1996.0046.  URL https://doi.org/10.1006/jagm.1996.0046.
  * Ramalingam and Reps [1996b] G. Ramalingam and Thomas W. Reps.  On the computational complexity of dynamic graph problems.  _Theor. Comput. Sci._ , 158(1&2):233–277, 1996b.  doi: 10.1016/0304-3975(95)00079-8.  URL https://doi.org/10.1016/0304-3975(95)00079-8.
  * Riazi et al. [2018] Sara Riazi, Sriram Srinivasan, Sajal K. Das, Sanjukta Bhowmick, and Boyana Norris.  Single-source shortest path tree for big dynamic graphs.  In Naoki Abe, Huan Liu, Calton Pu, Xiaohua Hu, Nesreen K. Ahmed, Mu Qiao, Yang Song, Donald Kossmann, Bing Liu, Kisung Lee, Jiliang Tang, Jingrui He, and Jeffrey S. Saltz, editors, _IEEE International Conference on Big Data, Big Data 2018, Seattle, WA, USA, December 10-13, 2018_ , pages 4054–4062. IEEE, 2018.  doi: 10.1109/BigData.2018.8622042.  URL https://doi.org/10.1109/BigData.2018.8622042.
  * Ribeiro and Toso [2007] Celso C. Ribeiro and Rodrigo F. Toso.  Experimental analysis of algorithms for updating minimum spanning trees on graphs subject to changes on edge weights.  In Demetrescu [2007], pages 393–405.  ISBN 978-3-540-72844-3.  doi: 10.1007/978-3-540-72845-0“˙30.  URL https://doi.org/10.1007/978-3-540-72845-0_30.
  * Riondato and Kornaropoulos [2014] Matteo Riondato and Evgenios M. Kornaropoulos.  Fast approximation of betweenness centrality through sampling.  In Ben Carterette, Fernando Diaz, Carlos Castillo, and Donald Metzler, editors, _Seventh ACM International Conference on Web Search and Data Mining, WSDM 2014, New York, NY, USA, February 24-28, 2014_ , pages 413–422. ACM, 2014.  doi: 10.1145/2556195.2556224.  URL https://doi.org/10.1145/2556195.2556224.
  * Roditty [2008] Liam Roditty.  A faster and simpler fully dynamic transitive closure.  _ACM Trans. Algorithms_ , 4(1):6:1–6:16, 2008\.  doi: 10.1145/1328911.1328917.  URL https://doi.org/10.1145/1328911.1328917.
  * Roditty and Zwick [2008] Liam Roditty and Uri Zwick.  Improved dynamic reachability algorithms for directed graphs.  _SIAM J. Comput._ , 37(5):1455–1471, 2008.  doi: 10.1137/060650271.  URL https://doi.org/10.1137/060650271.
  * Roditty and Zwick [2016] Liam Roditty and Uri Zwick.  A fully dynamic reachability algorithm for directed graphs with an almost linear update time.  _SIAM Journal on Computing_ , 45(3):712–733, 2016.  doi: 10.1137/13093618X.  URL https://doi.org/10.1137/13093618X.
  * Rokne and Faloutsos [2013] Jon G. Rokne and Christos Faloutsos, editors.  _Advances in Social Networks Analysis and Mining 2013, ASONAM ’13, Niagara, ON, Canada - August 25 - 29, 2013_ , 2013. ACM.  ISBN 978-1-4503-2240-9.  URL http://dl.acm.org/citation.cfm?id=2492517.
  * Rossetti and Cazabet [2018] Giulio Rossetti and Rémy Cazabet.  Community discovery in dynamic networks: A survey.  _ACM Comput. Surv._ , 51(2):35:1–35:37, 2018\.  doi: 10.1145/3172867.  URL https://doi.org/10.1145/3172867.
  * Rotaru and Nägeli [2004] Tiberiu Rotaru and Hans-Heinrich Nägeli.  Dynamic load balancing by diffusion in heterogeneous systems.  _Journal of Parallel and Distributed Computing_ , 64(4):481–497, 2004.  doi: 10.1016/j.jpdc.2004.02.001.  URL https://doi.org/10.1016/j.jpdc.2004.02.001.
  * Sakouhi et al. [2016] Chayma Sakouhi, Sabeur Aridhi, Alessio Guerrieri, Salma Sassi, and Alberto Montresor.  Dynamicdfep: A distributed edge partitioning approach for large dynamic graphs.  In Evan Desai, Bipin C. Desai, Motomichi Toyama, and Jorge Bernardino, editors, _Proc. of the 20th International Database Engineering & Applications Symposium, IDEAS 2016, Montreal, QC, Canada, July 11-13, 2016_, pages 142–147. ACM, 2016.  ISBN 978-1-4503-4118-9.  doi: 10.1145/2938503.2938506.  URL https://doi.org/10.1145/2938503.2938506.
  * Sankowski [2004] Piotr Sankowski.  Dynamic transitive closure via dynamic matrix inverse (extended abstract).  In _45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proc._ , pages 509–517. IEEE Computer Society, 2004.  doi: 10.1109/FOCS.2004.25.  URL https://doi.org/10.1109/FOCS.2004.25.
  * Sankowski [2007] Piotr Sankowski.  Faster dynamic matchings and vertex connectivity.  In _SODA_ , pages 118–126, 2007.  doi: 10.1145/1283383.1283397.  URL http://doi.acm.org/10.1145/1283383.1283397.
  * Sariyüce et al. [2013a] Ahmet Erdem Sariyüce, Kamer Kaya, Erik Saule, and Ümit V. Çatalyürek.  Incremental algorithms for closeness centrality.  In Xiaohua Hu, Tsau Young Lin, Vijay V. Raghavan, Benjamin W. Wah, Ricardo Baeza-Yates, Geoffrey C. Fox, Cyrus Shahabi, Matthew Smith, Qiang Yang, Rayid Ghani, Wei Fan, Ronny Lempel, and Raghunath Nambiar, editors, _Proc. of the 2013 IEEE International Conference on Big Data, 6-9 October 2013, Santa Clara, CA, USA_ , pages 487–492. IEEE Computer Society, 2013a.  ISBN 978-1-4799-1292-6.  doi: 10.1109/BigData.2013.6691611.  URL https://doi.org/10.1109/BigData.2013.6691611.
  * Sariyüce et al. [2013b] Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, and Ümit V. Çatalyürek.  STREAMER: A distributed framework for incremental closeness centrality computation.  In _2013 IEEE International Conference on Cluster Computing, CLUSTER 2013, Indianapolis, IN, USA, September 23-27, 2013_ , pages 1–8. IEEE Computer Society, 2013b.  ISBN 978-1-4799-0898-1.  doi: 10.1109/CLUSTER.2013.6702680.  URL https://doi.org/10.1109/CLUSTER.2013.6702680.
  * Sariyüce et al. [2015] Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, and Ümit V. Çatalyürek.  Incremental closeness centrality in distributed memory.  _Parallel Comput._ , 47:3–18, 2015.  doi: 10.1016/j.parco.2015.01.003.  URL https://doi.org/10.1016/j.parco.2015.01.003.
  * Sariyüce et al. [2016] Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, and Ümit V. Çatalyürek.  Incremental k-core decomposition: algorithms and evaluation.  _VLDB J._ , 25(3):425–447, 2016.  doi: 10.1007/s00778-016-0423-8.  URL https://doi.org/10.1007/s00778-016-0423-8.
  * Schiller et al. [2015] Benjamin Schiller, Sven Jager, Kay Hamacher, and Thorsten Strufe.  Stream - A stream-based algorithm for counting motifs in dynamic graphs.  In Adrian-Horia Dediu, Francisco Hernández Quiroz, Carlos Martín-Vide, and David A. Rosenblueth, editors, _Algorithms for Computational Biology - Second International Conference, AlCoB 2015, Mexico City, Mexico, August 4-5, 2015, Proc._ , volume 9199 of _Lecture Notes in Computer Science_ , pages 53–67. Springer, 2015.  ISBN 978-3-319-21232-6.  doi: 10.1007/978-3-319-21233-3“˙5.  URL https://doi.org/10.1007/978-3-319-21233-3_5.
  * Schloegel et al. [1997] Kirk Schloegel, George Karypis, and Vipin Kumar.  Multilevel diffusion schemes for repartitioning of adaptive meshes.  _J. Parallel Distributed Comput._ , 47(2):109–124, 1997.  doi: 10.1006/jpdc.1997.1410.  URL https://doi.org/10.1006/jpdc.1997.1410.
  * Schloegel et al. [2000] Kirk Schloegel, George Karypis, and Vipin Kumar.  A unified algorithm for load-balancing adaptive scientific simulations.  In Jed Donnelley, editor, _Proc. Supercomputing 2000, November 4-10, 2000, Dallas, Texas, USA. IEEE Computer Society, CD-ROM_ , page 59. IEEE Computer Society, 2000.  ISBN 0-7803-9802-5.  doi: 10.1109/SC.2000.10035.  URL https://doi.org/10.1109/SC.2000.10035.
  * Schloegel et al. [2002] Kirk Schloegel, George Karypis, and Vipin Kumar.  Parallel static and dynamic multi-constraint graph partitioning.  _Concurr. Comput. Pract. Exp._ , 14(3):219–240, 2002.  doi: 10.1002/cpe.605.  URL https://doi.org/10.1002/cpe.605.
  * Schultes and Sanders [2007] Dominik Schultes and Peter Sanders.  Dynamic highway-node routing.  In Demetrescu [2007], pages 66–79.  ISBN 978-3-540-72844-3.  doi: 10.1007/978-3-540-72845-0“˙6.  URL https://doi.org/10.1007/978-3-540-72845-0_6.
  * Sengupta et al. [2016] Dipanjan Sengupta, Narayanan Sundaram, Xia Zhu, Theodore L Willke, Jeffrey Young, Matthew Wolf, and Karsten Schwan.  Graphin: An online high performance incremental graph processing framework.  In _European Conference on Parallel Processing_ , pages 319–333. Springer, 2016.  doi: 10.1007/978-3-319-43659-3“˙24.  URL https://doi.org/10.1007/978-3-319-43659-3_24.
  * Sengupta et al. [2017] Neha Sengupta, Michael Hamann, and Dorothea Wagner.  Benchmark generator for dynamic overlapping communities in networks.  In Vijay Raghavan, Srinivas Aluru, George Karypis, Lucio Miele, and Xindong Wu, editors, _2017 IEEE International Conference on Data Mining, ICDM 2017, New Orleans, LA, USA, November 18-21, 2017_ , pages 415–424. IEEE Computer Society, 2017.  doi: 10.1109/ICDM.2017.51.  URL https://doi.org/10.1109/ICDM.2017.51.
  * Shao et al. [2020] Zhenzhen Shao, Na Guo, Yu Gu, Zhigang Wang, Fangfang Li, and Ge Yu.  Efficient closeness centrality computation for dynamic graphs.  In Yunmook Nah, Bin Cui, Sang-Won Lee, Jeffrey Xu Yu, Yang-Sae Moon, and Steven Euijong Whang, editors, _Database Systems for Advanced Applications - 25th International Conference, DASFAA 2020, Jeju, South Korea, September 24-27, 2020, Proc., Part II_ , volume 12113 of _Lecture Notes in Computer Science_ , pages 534–550. Springer, 2020.  ISBN 978-3-030-59415-2.  doi: 10.1007/978-3-030-59416-9“˙32.  URL https://doi.org/10.1007/978-3-030-59416-9_32.
  * Shiloach and Even [1981] Y. Shiloach and S. Even.  An on-line edge-deletion problem.  _Journal of the ACM_ , 28(1):1–4, 1981.  ISSN 0004-5411.  doi: 10.1145/322234.322235.  URL https://doi.org/10.1145/322234.322235.
  * Sleator and Tarjan [1981] Daniel Dominic Sleator and Robert Endre Tarjan.  A data structure for dynamic trees.  In _Proc. of the 13th Annual ACM Symposium on Theory of Computing, May 11-13, 1981, Milwaukee, Wisconsin, USA_ , pages 114–122. ACM, 1981.  doi: 10.1145/800076.802464.  URL https://doi.org/10.1145/800076.802464.
  * Solomon [2016] Shay Solomon.  Fully dynamic maximal matching in constant update time.  In _57th Symposium on Foundations of Computer Science FOCS_ , pages 325–334, 2016.  doi: 10.1109/FOCS.2016.43.  URL https://doi.org/10.1109/FOCS.2016.43.
  * Stefani et al. [2017] Lorenzo De Stefani, Alessandro Epasto, Matteo Riondato, and Eli Upfal.  Trièst: Counting local and global triangles in fully dynamic streams with fixed memory size.  _ACM Trans. Knowl. Discov. Data_ , 11(4):43:1–43:50, 2017.  doi: 10.1145/3059194.  URL https://doi.org/10.1145/3059194.
  * Stubbs and Williams [2017] Daniel Stubbs and Virginia Vassilevska Williams.  Metatheorems for dynamic weighted matching.  In Christos H. Papadimitriou, editor, _8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA_ , volume 67 of _LIPIcs_ , pages 58:1–58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.  ISBN 978-3-95977-029-3.  doi: 10.4230/LIPIcs.ITCS.2017.58.  URL https://doi.org/10.4230/LIPIcs.ITCS.2017.58.
  * Sun et al. [2020] Bintao Sun, T.-H. Hubert Chan, and Mauro Sozio.  Fully dynamic approximate k-core decomposition in hypergraphs.  _ACM Trans. Knowl. Discov. Data_ , 14(4), May 2020.  ISSN 1556-4681.  doi: 10.1145/3385416.  URL https://doi.org/10.1145/3385416.
  * Tarjan [1975] Robert Endre Tarjan.  Efficiency of a good but not linear set union algorithm.  _J. ACM_ , 22(2):215–225, 1975.  doi: 10.1145/321879.321884.  URL https://doi.org/10.1145/321879.321884.
  * Tarjan and Werneck [2009] Robert Endre Tarjan and Renato Fonseca F. Werneck.  Dynamic trees in practice.  _ACM J. Exp. Algorithmics_ , 14, 2009.  doi: 10.1145/1498698.1594231.  URL https://doi.org/10.1145/1498698.1594231.
  * Thorup [2004] Mikkel Thorup.  Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles.  In Torben Hagerup and Jyrki Katajainen, editors, _Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proc._ , volume 3111 of _Lecture Notes in Computer Science_ , pages 384–396. Springer, 2004.  doi: 10.1007/978-3-540-27810-8“˙33.  URL https://doi.org/10.1007/978-3-540-27810-8_33.
  * Tremblay and Florian [2001] Nicolas Tremblay and Michael Florian.  Temporal shortest paths: Parallel computing implementations.  _Parallel Comput._ , 27(12):1569–1609, 2001.  doi: 10.1016/S0167-8191(01)00107-7.  URL https://doi.org/10.1016/S0167-8191(01)00107-7.
  * van den Brand et al. [2019] Jan van den Brand, Danupon Nanongkai, and Thatchaphol Saranurak.  Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds.  In David Zuckerman, editor, _60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019_ , pages 456–480. IEEE Computer Society, 2019.  doi: 10.1109/FOCS.2019.00036.  URL https://doi.org/10.1109/FOCS.2019.00036.
  * van der Grinten et al. [2018] Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, and Henning Meyerhenke.  Scalable katz ranking computation in large static and dynamic graphs.  In Yossi Azar, Hannah Bast, and Grzegorz Herman, editors, _26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland_ , volume 112 of _LIPIcs_ , pages 42:1–42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.  ISBN 978-3-95977-081-1.  doi: 10.4230/LIPIcs.ESA.2018.42.  URL https://doi.org/10.4230/LIPIcs.ESA.2018.42.
  * Vaquero et al. [2013] Luis M. Vaquero, Félix Cuadrado, Dionysios Logothetis, and Claudio Martella.  xdgp: A dynamic graph processing system with adaptive partitioning.  _CoRR_ , abs/1309.1049, 2013.  URL http://arxiv.org/abs/1309.1049.
  * Vaquero et al. [2014] Luis M. Vaquero, Félix Cuadrado, Dionysios Logothetis, and Claudio Martella.  Adaptive partitioning for large-scale dynamic graphs.  In _IEEE 34th International Conference on Distributed Computing Systems, ICDCS 2014, Madrid, Spain, June 30 - July 3, 2014_ , pages 144–153. IEEE Computer Society, 2014.  ISBN 978-1-4799-5168-0.  doi: 10.1109/ICDCS.2014.23.  URL https://doi.org/10.1109/ICDCS.2014.23.
  * Verma and Batra [2012] Tanmay Verma and Dhruv Batra.  Maxflow revisited: An empirical comparison of maxflow algorithms for dense vision problems.  In Richard Bowden, John P. Collomosse, and Krystian Mikolajczyk, editors, _British Machine Vision Conference, BMVC 2012, Surrey, UK, September 3-7, 2012_ , pages 1–12. BMVA Press, 2012.  doi: 10.5244/C.26.61.  URL https://doi.org/10.5244/C.26.61.
  * Wagner et al. [2005] Dorothea Wagner, Thomas Willhalm, and Christos D. Zaroliagis.  Geometric containers for efficient shortest-path computation.  _ACM J. Exp. Algorithmics_ , 10, 2005.  doi: 10.1145/1064546.1103378.  URL https://doi.org/10.1145/1064546.1103378.
  * Walshaw et al. [1997] Chris Walshaw, Mark Cross, and Martin G. Everett.  Parallel dynamic graph partitioning for adaptive unstructured meshes.  _J. Parallel Distributed Comput._ , 47(2):102–108, 1997.  doi: 10.1006/jpdc.1997.1407.  URL https://doi.org/10.1006/jpdc.1997.1407.
  * Wang et al. [2020] Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, and Kian-Lee Tan.  Efficient sampling algorithms for approximate temporal motif counting.  In Mathieu d’Aquin, Stefan Dietze, Claudia Hauff, Edward Curry, and Philippe Cudré-Mauroux, editors, _CIKM ’20: The 29th ACM International Conference on Information and Knowledge Management, Virtual Event, Ireland, October 19-23, 2020_ , pages 1505–1514. ACM, 2020.  ISBN 978-1-4503-6859-9.  doi: 10.1145/3340531.3411862.  URL https://doi.org/10.1145/3340531.3411862.
  * Wang et al. [2017] Na Wang, Dongxiao Yu, Hai Jin, Chen Qian, Xia Xie, and Qiang-Sheng Hua.  Parallel algorithm for core maintenance in dynamic graphs.  In Kisung Lee and Ling Liu, editors, _37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5-8, 2017_ , pages 2366–2371. IEEE Computer Society, 2017.  ISBN 978-1-5386-1792-2.  doi: 10.1109/ICDCS.2017.288.  URL https://doi.org/10.1109/ICDCS.2017.288.
  * Weigert et al. [2011] Stefan Weigert, Matti Hiltunen, and Christof Fetzer.  Mining large distributed log data in near real time.  In _Managing Large-scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques_ , pages 1–8. 2011.  doi: 10.1145/2038633.2038638.  URL https://doi.org/10.1145/2038633.2038638.
  * Winter et al. [2018] Martin Winter, Daniel Mlakar, Rhaleb Zayer, Hans-Peter Seidel, and Markus Steinberger.  faimgraph: high performance management of fully-dynamic graphs under tight memory constraints on the GPU.  In _Proc. of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC 2018, Dallas, TX, USA, November 11-16, 2018_ , pages 60:1–60:13. IEEE / ACM, 2018.  URL http://dl.acm.org/citation.cfm?id=3291736.
  * Xu et al. [2014] Ning Xu, Lei Chen, and Bin Cui.  Loggp: a log-based dynamic graph partitioning method.  _Proc. of the VLDB Endowment_ , 7(14):1917–1928, 2014.  doi: 10.14778/2733085.2733097.  URL https://doi.org/10.14778/2733085.2733097.
  * Yellin [1993] Daniel M. Yellin.  Speeding up dynamic transitive closure for bounded degree graphs.  _Acta Informatica_ , 30(4):369–384, 1993.  doi: 10.1007/BF01209711.  URL https://doi.org/10.1007/BF01209711.
  * Yen et al. [2013] Chia-Chen Yen, Mi-Yen Yeh, and Ming-Syan Chen.  An efficient approach to updating closeness centrality and average path length in dynamic networks.  In Hui Xiong, George Karypis, Bhavani M. Thuraisingham, Diane J. Cook, and Xindong Wu, editors, _2013 IEEE 13th International Conference on Data Mining, Dallas, TX, USA, December 7-10, 2013_ , pages 867–876. IEEE Computer Society, 2013.  ISBN 978-0-7695-5108-1.  doi: 10.1109/ICDM.2013.135.  URL https://doi.org/10.1109/ICDM.2013.135.
  * Zakrzewska and Bader [2016] Anita Zakrzewska and David A. Bader.  Fast incremental community detection on dynamic graphs.  In Roman Wyrzykowski, Ewa Deelman, Jack Dongarra, Konrad Karczewski, Jacek Kitowski, and Kazimierz Wiatr, editors, _Parallel Processing and Applied Mathematics_ , pages 207–217, Cham, 2016. Springer International Publishing.  ISBN 978-3-319-32149-3.  doi: 10.1007/978-3-319-32149-3“˙20.  URL https://doi.org/10.1007/978-3-319-32149-3_20.
  * Zaroliagis [2002] Christos D Zaroliagis.  Implementations and experimental studies of dynamic graph algorithms.  In _Experimental algorithmics_ , pages 229–278. Springer, 2002.  doi: 10.1007/3-540-36383-1“˙11.  URL https://doi.org/10.1007/3-540-36383-1_11.
  * Zhang et al. [2017] Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, and Lu Qin.  A fast order-based approach for core maintenance.  In _33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, CA, USA, April 19-22, 2017_ , pages 337–348. IEEE Computer Society, 2017.  ISBN 978-1-5090-6543-1.  doi: 10.1109/ICDE.2017.93.  URL https://doi.org/10.1109/ICDE.2017.93.
  * Zheng et al. [2018] Weiguo Zheng, Qichen Wang, Jeffrey Xu Yu, Hong Cheng, and Lei Zou.  Efficient computation of a near-maximum independent set over evolving graphs.  In _34th IEEE International Conference on Data Engineering, ICDE 2018, Paris, France, April 16-19, 2018_ , pages 869–880. IEEE Computer Society, 2018.  ISBN 978-1-5386-5520-7.  doi: 10.1109/ICDE.2018.00083.  URL https://doi.org/10.1109/ICDE.2018.00083.
  * Zheng et al. [2019] Weiguo Zheng, Chengzhi Piao, Hong Cheng, and Jeffrey Xu Yu.  Computing a near-maximum independent set in dynamic graphs.  In _35th IEEE International Conference on Data Engineering, ICDE 2019, Macao, China, April 8-11, 2019_ , pages 76–87. IEEE, 2019.  ISBN 978-1-5386-7474-1.  doi: 10.1109/ICDE.2019.00016.  URL https://doi.org/10.1109/ICDE.2019.00016.
  * Zhu et al. [2016] Lei Zhu, Shaoning Pang, Abdolhossein Sarrafzadeh, Tao Ban, and Daisuke Inoue.  Incremental and decremental max-flow for online semi-supervised learning.  _IEEE Trans. Knowl. Data Eng._ , 28(8):2115–2127, 2016.  doi: 10.1109/TKDE.2016.2550042.  URL https://doi.org/10.1109/TKDE.2016.2550042.
  * Zhuang et al. [2019] Di Zhuang, Morris J Chang, and Mingchen Li.  Dynamo: Dynamic community detection by incrementally maximizing modularity.  _IEEE Transactions on Knowledge and Data Engineering_ , 2019.  doi: 10.1109/TKDE.2019.2951419.  URL https://doi.org/10.1109/TKDE.2019.2951419.
  * Zou et al. [2016] Yiming Zou, Gang Zeng, Yuyi Wang, Xingwu Liu, Xiaoming Sun, Jialin Zhang, and Qiang Li.  Shortest paths on evolving graphs.  In Hien T. Nguyen and Václav Snásel, editors, _Computational Social Networks - 5th International Conference, CSoNet_ , volume 9795 of _Lecture Notes in Computer Science_ , pages 1–13. Springer, 2016.  ISBN 978-3-319-42344-9.  doi: 10.1007/978-3-319-42345-6“˙1.  URL https://doi.org/10.1007/978-3-319-42345-6_1.
  * Zuckerman [2019] David Zuckerman, editor.  _60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019_ , 2019. IEEE Computer Society.  ISBN 978-1-7281-4952-3.  URL https://ieeexplore.ieee.org/xpl/conhome/8936052/proceeding.