@InProceedings{fluschnik_et_al:LIPIcs.SAND.2022.16,
author = {Fluschnik, Till and Kunz, Pascal},
title = {{Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring}},
booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-224-2},
ISSN = {1868-8969},
year = {2022},
volume = {221},
editor = {Aspnes, James and Michail, Othon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.16},
URN = {urn:nbn:de:0030-drops-159587},
doi = {10.4230/LIPIcs.SAND.2022.16},
annote = {Keywords: structural parameters, NP-hardness, parameterized algorithms, multistage problems}
}