{"date_published":"2017-12-22T00:00:00Z","day":"22","publication_status":"published","date_created":"2022-08-08T13:16:37Z","publication":"44th International Conference on Current Trends in Theory and Practice of Computer Science","citation":{"mla":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, vol. 10706, Springer Nature, 2017, pp. 40–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">10.1007/978-3-319-73117-9_3</a>.","ista":"Henzinger MH. 2017. The state of the art in dynamic graph algorithms. 44th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Theory and Practice of Computer Science, LNCS, vol. 10706, 40–44.","short":"M.H. Henzinger, in:, 44th International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2017, pp. 40–44.","ama":"Henzinger MH. The state of the art in dynamic graph algorithms. In: <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>. Vol 10706. Springer Nature; 2017:40–44. doi:<a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">10.1007/978-3-319-73117-9_3</a>","ieee":"M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, Krems, Austria, 2017, vol. 10706, pp. 40–44.","apa":"Henzinger, M. H. (2017). The state of the art in dynamic graph algorithms. In <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i> (Vol. 10706, pp. 40–44). Krems, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">https://doi.org/10.1007/978-3-319-73117-9_3</a>","chicago":"Henzinger, Monika H. “The State of the Art in Dynamic Graph Algorithms.” In <i>44th International Conference on Current Trends in Theory and Practice of Computer Science</i>, 10706:40–44. Springer Nature, 2017. <a href=\"https://doi.org/10.1007/978-3-319-73117-9_3\">https://doi.org/10.1007/978-3-319-73117-9_3</a>."},"conference":{"end_date":"2018-02-02","start_date":"2018-01-29","name":"SOFSEM: Theory and Practice of Computer Science","location":"Krems, Austria"},"type":"conference","author":[{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger"}],"date_updated":"2023-02-10T08:36:03Z","month":"12","doi":"10.1007/978-3-319-73117-9_3","title":"The state of the art in dynamic graph algorithms","_id":"11772","alternative_title":["LNCS"],"volume":10706,"article_processing_charge":"No","scopus_import":"1","intvolume":"     10706","language":[{"iso":"eng"}],"publisher":"Springer Nature","quality_controlled":"1","abstract":[{"text":"A dynamic graph algorithm is a data structure that supports operations on dynamically changing graphs.","lang":"eng"}],"year":"2017","publication_identifier":{"eisbn":["9783319731179"],"issn":["0302-9743"],"isbn":["9783319731162"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"40–44","oa_version":"None","extern":"1","status":"public"}