Level Planarity Is More Difficult Than We Thought
<|reference_start|>Level Planarity Is More Difficult Than We Thought: We consider three simple quadratic time algorithms for the problem Level Planarity and give a level-planar instance that they either falsely report as negative or for which they output a drawing that is not level planar.<|reference_end|>
@article{fink2024level,
    title={Level Planarity Is More Difficult Than We Thought},
    author={Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf},
    journal={arXiv preprint arXiv:2409.01727},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.01727},
    primaryClass={cs.DM}
}