Bhattacharya, S., Henzinger, M., & Nanongkai, D. (2017). Fully Dynamic Approximate
Maximum Matching and Minimum Vertex Cover in O(log3 n) Worst Case Update Time. In P. N. Klein (Ed.),
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp.
470-489). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.
