Standard
On the hardness of partially dynamic graph problems and connections to diameter. / Dahlgaard, Søren.
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). ed. / Ioannis Chatzigiannakis; Michael Mitzenmacher; Yuval Rabani; Davide Sangiorgi. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. 48 (Leibniz International Proceedings in Informatics, Vol. 55).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Dahlgaard, S 2016,
On the hardness of partially dynamic graph problems and connections to diameter. in I Chatzigiannakis, M Mitzenmacher, Y Rabani & D Sangiorgi (eds),
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)., 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 55, International Colloquium on Automata, Languages, and Programming 2016, Rom, Italy,
12/07/2016.
https://doi.org/10.4230/LIPIcs.ICALP.2016.48APA
Dahlgaard, S. (2016).
On the hardness of partially dynamic graph problems and connections to diameter. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani, & D. Sangiorgi (Eds.),
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) [48] Schloss Dagstuhl - Leibniz-Zentrum für Informatik. Leibniz International Proceedings in Informatics Vol. 55
https://doi.org/10.4230/LIPIcs.ICALP.2016.48Vancouver
Dahlgaard S.
On the hardness of partially dynamic graph problems and connections to diameter. In Chatzigiannakis I, Mitzenmacher M, Rabani Y, Sangiorgi D, editors, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2016. 48. (Leibniz International Proceedings in Informatics, Vol. 55).
https://doi.org/10.4230/LIPIcs.ICALP.2016.48Author
Dahlgaard, Søren. / On the hardness of partially dynamic graph problems and connections to diameter. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). editor / Ioannis Chatzigiannakis ; Michael Mitzenmacher ; Yuval Rabani ; Davide Sangiorgi. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. (Leibniz International Proceedings in Informatics, Vol. 55).
Bibtex
@inproceedings{f54766b30a8140d1a0f4a03673a2dcad,
title = "On the hardness of partially dynamic graph problems and connections to diameter",
author = "S{\o}ren Dahlgaard",
year = "2016",
doi = "10.4230/LIPIcs.ICALP.2016.48",
language = "English",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi",
booktitle = "43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)",
note = "null ; Conference date: 12-07-2016 Through 15-07-2016",
}
RIS
TY - GEN
T1 - On the hardness of partially dynamic graph problems and connections to diameter
AU - Dahlgaard, Søren
N1 - Conference code: 43
PY - 2016
Y1 - 2016
U2 - 10.4230/LIPIcs.ICALP.2016.48
DO - 10.4230/LIPIcs.ICALP.2016.48
M3 - Article in proceedings
T3 - Leibniz International Proceedings in Informatics
BT - 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
A2 - Chatzigiannakis, Ioannis
A2 - Mitzenmacher, Michael
A2 - Rabani, Yuval
A2 - Sangiorgi, Davide
PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Y2 - 12 July 2016 through 15 July 2016
ER -
