@InProceedings{ganian_et_al:LIPIcs.GD.2024.43,
author = {Ganian, Robert and N\"{o}llenburg, Martin and R\"{o}der, Sebastian},
title = {{Minimizing Switches in Cased Graph Drawings}},
booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
pages = {43:1--43: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.43},
URN = {urn:nbn:de:0030-drops-213271},
doi = {10.4230/LIPIcs.GD.2024.43},
annote = {Keywords: beyond planarity, complexity theory, non-planar drawings, crossings}
}