{"status":"public","external_id":{"arxiv":["2102.11169"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_processing_charge":"No","citation":{"apa":"Hanauer, K., Henzinger, M. H., &#38; Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i> (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>","ista":"Hanauer K, Henzinger MH, Schulz C. 2022. Recent advances in fully dynamic graph algorithms. 1st Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 221, 1.","chicago":"Hanauer, Kathrin, Monika H Henzinger, and Christian Schulz. “Recent Advances in Fully Dynamic Graph Algorithms.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Vol. 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">https://doi.org/10.4230/LIPIcs.SAND.2022.1</a>.","ieee":"K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, Virtual, 2022, vol. 221.","short":"K. Hanauer, M.H. Henzinger, C. Schulz, in:, 1st Symposium on Algorithmic Foundations of Dynamic Networks, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.","ama":"Hanauer K, Henzinger MH, Schulz C. Recent advances in fully dynamic graph algorithms. In: <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>","mla":"Hanauer, Kathrin, et al. “Recent Advances in Fully Dynamic Graph Algorithms.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks</i>, vol. 221, 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.1\">10.4230/LIPIcs.SAND.2022.1</a>."},"date_created":"2022-08-11T14:35:52Z","month":"04","doi":"10.4230/LIPIcs.SAND.2022.1","author":[{"first_name":"Kathrin","full_name":"Hanauer, Kathrin","last_name":"Hanauer"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","full_name":"Henzinger, Monika H"},{"last_name":"Schulz","full_name":"Schulz, Christian","first_name":"Christian"}],"conference":{"end_date":"2022-03-30","start_date":"2022-03-28","location":"Virtual","name":"SAND: Symposium on Algorithmic Foundations of Dynamic Networks"},"_id":"11808","alternative_title":["LIPIcs"],"publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks","publication_status":"published","article_number":"1","abstract":[{"text":"In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.","lang":"eng"}],"volume":221,"date_updated":"2023-02-14T08:14:41Z","type":"conference","extern":"1","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772242"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2022","day":"29","date_published":"2022-04-29T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.SAND.2022.1"}],"title":"Recent advances in fully dynamic graph algorithms","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","intvolume":"       221","language":[{"iso":"eng"}]}