Bhattacharya, Sayan, et al. “A New Deterministic Algorithm for Dynamic Set Cover.”10.1109/focs.2019.00033__60th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2019, pp. 406–23, doi:10.1109/focs.2019.00033.
LibreCat: https://research-explorer.ista.ac.at/record/11853
DOI: 10.1109/focs.2019.00033
arXiv: 1909.11600

Henzinger, Monika H., et al. “Shared-Memory Exact Minimum Cuts.”10.1109/ipdps.2019.00013__33rd International Parallel and Distributed Processing Symposium, 8820968, Institute of Electrical and Electronics Engineers, 2019, doi:10.1109/ipdps.2019.00013.
LibreCat: https://research-explorer.ista.ac.at/record/11851
DOI: 10.1109/ipdps.2019.00013
arXiv: 1808.05458

Daga, Mohit, et al. “Distributed Edge Connectivity in Sublinear Time.”10.1145/3313276.3316346__Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Association for Computing Machinery, 2019, pp. 343–354, doi:10.1145/3313276.3316346.
LibreCat: https://research-explorer.ista.ac.at/record/11865
DOI: 10.1145/3313276.3316346
arXiv: 1904.04341

Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.”10.1137/1.9781611975482.115__30th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2019, pp. 1899–918, doi:10.1137/1.9781611975482.115.
LibreCat: https://research-explorer.ista.ac.at/record/11871
DOI: 10.1137/1.9781611975482.115
arXiv: 1810.10932

Bhattacharya, Sayan, et al. “New Amortized Cell-Probe Lower Bounds for Dynamic Problems.”10.1016/j.tcs.2019.01.043__Theoretical Computer Science, vol. 779, Elsevier, 2019, pp. 72–87, doi:10.1016/j.tcs.2019.01.043.
LibreCat: https://research-explorer.ista.ac.at/record/11898
DOI: 10.1016/j.tcs.2019.01.043
arXiv: 1902.02304