Showing 2024Show all
2 papers · 1 filter
cs.CG2024
A Simple Partially Embedded Planarity Test Based on Vertex-Addition
Simon D. Fink, Ignaz Rutter, Sandhya T. P
In the Partially Embedded Planarity problem, we are given a graph together with a topological drawing of a subgraph of . The task is to decide whether the drawing can be…
cs.DM2024
Level Planarity Is More Difficult Than We Thought
Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter +1
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 ou…