@inproceedings{FominGLSSS22,
 address = {Dagstuhl, Germany},
 annote = {Keywords: longest path, longest detour, diameter, directed graphs, parameterized complexity},
 author = {Fomin, Fedor V. and Golovach, Petr A. and Lochet, William and Sagunov, Danil and Simonov, Kirill and Saurabh, Saket},
 booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
 doi = {10.4230/LIPIcs.STACS.2022.29},
 editor = {Berenbrink, Petra and Monmege, Benjamin},
 isbn = {978-3-95977-222-8},
 issn = {1868-8969},
 keywords = {ParAI},
 pages = {29:1–29:16},
 publisher = {Schloss Dagstuhl – Leibniz-Zentrum f{ü}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 title = {{Detours in Directed Graphs}},
 url = {https://drops.dagstuhl.de/opus/volltexte/2022/15839},
 urn = {urn:nbn:de:0030-drops-158390},
 volume = {219},
 year = {2022}
}