@InProceedings{klemz_et_al:LIPIcs.ICALP.2024.99,
author = {Klemz, Boris and Sieper, Marie Diana},
title = {{Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number}},
booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)},
pages = {99:1--99:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-322-5},
ISSN = {1868-8969},
year = {2024},
volume = {297},
editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.99},
URN = {urn:nbn:de:0030-drops-202428},
doi = {10.4230/LIPIcs.ICALP.2024.99},
annote = {Keywords: Parameterized Complexity, Graph Drawing, Planar Poset Diagram, Level Planarity, Constrained Level Planarity, Vertex Cover, FPT, Computational Geometry}
}