@InProceedings{zschoche_et_al:LIPIcs.MFCS.2018.45,
author = {Zschoche, Philipp and Fluschnik, Till and Molter, Hendrik and Niedermeier, Rolf},
title = {{The Complexity of Finding Small Separators in Temporal Graphs}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {45:1--45:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.45},
URN = {urn:nbn:de:0030-drops-96277},
doi = {10.4230/LIPIcs.MFCS.2018.45},
annote = {Keywords: (non-)strict temporal paths, temporal core, single-source shortest paths, node multiway cut, length-bounded cuts, parameterized complexity}
}