Søren Dahlgaard. On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, Davide Sangiorgi, editors, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy. Volume 55 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{Dahlgaard16,
title = {On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter},
author = {Søren Dahlgaard},
year = {2016},
doi = {10.4230/LIPIcs.ICALP.2016.48},
url = {http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.48},
researchr = {https://researchr.org/publication/Dahlgaard16},
cites = {0},
citedby = {0},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
volume = {55},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-013-2},
}