1. Dynamic set cover: improved algorithms and lower bounds
2. Sepehr Assadi and Shay Solomon . 2021 . Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach . In Proc. 29th ESA. 204 , 8:1–8:18. Sepehr Assadi and Shay Solomon. 2021. Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. In Proc. 29th ESA. 204, 8:1–8:18.
3. S. Baswana , M. Gupta , and S. Sen . 2011. Fully Dynamic Maximal Matching in O( ologn) Update Time . In Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2011 , Palm Springs, CA , October 23-25, 2011 (see also SICOMP’15 version, and subsequent erratum). 383–392. S. Baswana, M. Gupta, and S. Sen. 2011. Fully Dynamic Maximal Matching in O( ologn) Update Time. In Proceedings of the 52nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, October 23-25, 2011 (see also SICOMP’15 version, and subsequent erratum). 383–392.
4. Online Bipartite Matching with Amortized Replacements
5. Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time