Bernstein, Aaron, van den Brand, Jan, Probst Gutenberg, Maximilian, Nanongkai, Danupon, Saranurak, Thatchaphol, Sidford, Aaron, and Sun, He. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. Retrieved from https://par.nsf.gov/biblio/10359739. Leibniz international proceedings in informatics 229.20

Bernstein, Aaron, van den Brand, Jan, Probst Gutenberg, Maximilian, Nanongkai, Danupon, Saranurak, Thatchaphol, Sidford, Aaron, & Sun, He. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. Leibniz international proceedings in informatics, 229 (20). Retrieved from https://par.nsf.gov/biblio/10359739.

Bernstein, Aaron, van den Brand, Jan, Probst Gutenberg, Maximilian, Nanongkai, Danupon, Saranurak, Thatchaphol, Sidford, Aaron, and Sun, He. "Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary". Leibniz international proceedings in informatics 229 (20). Country unknown/Code not available. https://par.nsf.gov/biblio/10359739.

@article{osti_10359739,
place = {Country unknown/Code not available}, title = {Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary}, url = {https://par.nsf.gov/biblio/10359739}, abstractNote = {}, journal = {Leibniz international proceedings in informatics}, volume = {229}, number = {20}, author = {Bernstein, Aaron and van den Brand, Jan and Probst Gutenberg, Maximilian and Nanongkai, Danupon and Saranurak, Thatchaphol and Sidford, Aaron and Sun, He}, }