activity
20212026
most citedParameterized Complexity of Vertex Splitting to Pathwidth at most 1

1 citations · 2 across the 8 of their papers we have counts for

collaborators
Showing cs.DMShow all

1 paper · 1 filter

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…