@InProceedings{bekos_et_al:LIPIcs.GD.2024.32,
author = {Bekos, Michael A. and Di Battista, Giuseppe and Di Giacomo, Emilio and Didimo, Walter and Kaufmann, Michael and Montecchiani, Fabrizio},
title = {{On the Complexity of Recognizing k^+-Real Face Graphs}},
booktitle = {32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)},
pages = {32:1--32:22},
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.32},
URN = {urn:nbn:de:0030-drops-213167},
doi = {10.4230/LIPIcs.GD.2024.32},
annote = {Keywords: Beyond planarity, k^+-real face drawings, 2-layer drawings, recognition algorithm, NP-hardness}
}