Goranci, Gramoz, Monika H Henzinger, and Mikkel Thorup. “Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time.”https://doi.org/10.1145/3174803__ACM Transactions on Algorithms. Association for Computing Machinery, 2018.https://doi.org/10.1145/3174803 .

Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe Italiano. “Dynamic Algorithms via the Primal-Dual Method.”https://doi.org/10.1016/j.ic.2018.02.005__Information and Computation. Elsevier, 2018.https://doi.org/10.1016/j.ic.2018.02.005 .

Goranci, Gramoz, Monika H Henzinger, and Pan Peng. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.”https://doi.org/10.4230/LIPICS.ESA.2018.40__In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.ESA.2018.40 .

Goranci, Gramoz , Monika H Henzinger, and Dariusz Leniowski. “A Tree Structure for Dynamic Facility Location.”https://doi.org/10.4230/LIPICS.ESA.2018.39__In 26th Annual European Symposium on Algorithms, Vol. 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPICS.ESA.2018.39 .

Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Decremental Single-Source Shortest Paths on Undirected Graphs in near-Linear Total Update Time.”https://doi.org/10.1145/3218657__Journal of the ACM. Association for Computing Machinery, 2018.https://doi.org/10.1145/3218657 .