@InProceedings{fink_et_al:LIPIcs.GD.2024.50,
author = {Fink, Simon D. and Pfretzschner, Matthias and Rutter, Ignaz and Stumpf, Peter},
title = {{Level Planarity Is More Difficult Than We Thought}},
booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
pages = {50:1--50:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-343-0},
ISSN = {1868-8969},
year = {2024},
volume = {320},
editor = {Felsner, Stefan and Klein, Karsten},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2024.50},
URN = {urn:nbn:de:0030-drops-213341},
doi = {10.4230/LIPIcs.GD.2024.50},
annote = {Keywords: level planarity, 2-SAT, simple algorithm, counterexample}
}