@InProceedings{morawietz_et_al:LIPIcs.MFCS.2020.71,
author = {Morawietz, Nils and Rehs, Carolin and Weller, Mathias},
title = {{A Timecop’s Work Is Harder Than You Think}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {71:1--71:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Esparza, Javier and Kr\'{a}l', Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.71},
URN = {urn:nbn:de:0030-drops-127404},
doi = {10.4230/LIPIcs.MFCS.2020.71},
annote = {Keywords: edge-periodic temporal graphs, cops and robbers, tally-intersection, congruence satisfyability}
}