Saurabh Sawlani, Junxing Wang. Near-optimal fully dynamic densest subgraph. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 181-193, ACM, 2020. [doi]
@inproceedings{SawlaniW20,
title = {Near-optimal fully dynamic densest subgraph},
author = {Saurabh Sawlani and Junxing Wang},
year = {2020},
doi = {10.1145/3357713.3384327},
url = {https://doi.org/10.1145/3357713.3384327},
researchr = {https://researchr.org/publication/SawlaniW20},
cites = {0},
citedby = {0},
pages = {181-193},
booktitle = {Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020},
editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath 0001 and Julia Chuzhoy},
publisher = {ACM},
isbn = {978-1-4503-6979-4},
}