@InProceedings{allender_et_al:LIPIcs.MFCS.2021.7,
author = {Allender, Eric and Chauhan, Archit and Datta, Samir},
title = {{Depth-First Search in Directed Planar Graphs, Revisited}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {7:1--7:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.7},
URN = {urn:nbn:de:0030-drops-144478},
doi = {10.4230/LIPIcs.MFCS.2021.7},
annote = {Keywords: Depth-First Search, Planar Digraphs, Parallel Algorithms, Space-Bounded Complexity Classes}
}