@InProceedings{baswana_et_al:LIPIcs.MFCS.2019.65,
author = {Baswana, Surender and Gupta, Shiv and Tulsyan, Ayush},
title = {{Fault Tolerant and Fully Dynamic DFS in Undirected Graphs: Simple Yet Efficient}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {65:1--65:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.65},
URN = {urn:nbn:de:0030-drops-110096},
doi = {10.4230/LIPIcs.MFCS.2019.65},
annote = {Keywords: Depth first search, DFS, Dynamic graph algorithms, Fault tolerant}
}