Danupon Nanongkai, Thatchaphol Saranurak, Christian Wulff-Nilsen. Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017. pages 950-961, IEEE Computer Society, 2017. [doi]
@inproceedings{NanongkaiSW17, title = {Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time}, author = {Danupon Nanongkai and Thatchaphol Saranurak and Christian Wulff-Nilsen}, year = {2017}, doi = {10.1109/FOCS.2017.92}, url = {https://doi.org/10.1109/FOCS.2017.92}, researchr = {https://researchr.org/publication/NanongkaiSW17}, cites = {0}, citedby = {0}, pages = {950-961}, booktitle = {58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017}, editor = {Chris Umans}, publisher = {IEEE Computer Society}, isbn = {978-1-5386-3464-6}, }