@InProceedings{dahlgaard:LIPIcs.ICALP.2016.48,
author = {Dahlgaard, S{\o}ren},
title = {{On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {48:1--48:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.48},
URN = {urn:nbn:de:0030-drops-63289},
doi = {10.4230/LIPIcs.ICALP.2016.48},
annote = {Keywords: Conditional lower bounds, Maximum cardinality matching, Diameter in graphs, Hardness in P, Partially dynamic problems, Maximum flow}
}