%0 Conference Paper %1 conf/sirocco/DAndreaDFLP13 %A D'Andrea, Annalisa %A D'Emidio, Mattia %A Frigioni, Daniele %A Leucci, Stefano %A Proietti, Guido %B SIROCCO %D 2013 %E Moscibroda, Thomas %E Rescigno, Adele A. %I Springer %K dblp %P 286-297 %T Dynamically Maintaining Shortest Path Trees under Batches of Updates. %U http://dblp.uni-trier.de/db/conf/sirocco/sirocco2013.html#DAndreaDFLP13 %V 8179 %@ 978-3-319-03577-2

@inproceedings{conf/sirocco/DAndreaDFLP13, added-at = {2022-06-23T00:00:00.000+0200}, author = {D'Andrea, Annalisa and D'Emidio, Mattia and Frigioni, Daniele and Leucci, Stefano and Proietti, Guido}, biburl = {https://www.bibsonomy.org/bibtex/22cfd103c6a80fc7cf5e99b77861ee606/dblp}, booktitle = {SIROCCO}, crossref = {conf/sirocco/2013}, editor = {Moscibroda, Thomas and Rescigno, Adele A.}, ee = {https://doi.org/10.1007/978-3-319-03578-9_24}, interhash = {aae6289ce9f62e3bd0107766de229b38}, intrahash = {2cfd103c6a80fc7cf5e99b77861ee606}, isbn = {978-3-319-03577-2}, keywords = {dblp}, pages = {286-297}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T03:51:54.000+0200}, title = {Dynamically Maintaining Shortest Path Trees under Batches of Updates.}, url = {http://dblp.uni-trier.de/db/conf/sirocco/sirocco2013.html#DAndreaDFLP13}, volume = 8179, year = 2013 }