%0 Conference Paper %1 conf/focs/BrandN19 %A van den Brand, Jan %A Nanongkai, Danupon %B FOCS %D 2019 %E Zuckerman, David %I IEEE Computer Society %K dblp %P 436-455 %T Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. %U http://dblp.uni-trier.de/db/conf/focs/focs2019.html#BrandN19 %@ 978-1-7281-4952-3

@inproceedings{conf/focs/BrandN19, added-at = {2021-10-14T00:00:00.000+0200}, author = {van den Brand, Jan and Nanongkai, Danupon}, biburl = {https://www.bibsonomy.org/bibtex/2d74867dc0c59d6a07092f53166e2a71f/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2019}, editor = {Zuckerman, David}, ee = {https://doi.org/10.1109/FOCS.2019.00035}, interhash = {f18c29dbea83b45dfbf2a2fd0c8b1c4f}, intrahash = {d74867dc0c59d6a07092f53166e2a71f}, isbn = {978-1-7281-4952-3}, keywords = {dblp}, pages = {436-455}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T14:12:56.000+0200}, title = {Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2019.html#BrandN19}, year = 2019 }