157 citations · 240 across the 13 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2022★ 3 cited
Planarizing Graphs and their Drawings by Vertex Splitting
Martin Nöllenburg, Manuel Sorge, Soeren Terziadis +3
The splitting number of a graph is the minimum number of vertex splits required to turn into a planar graph, where a vertex split removes a vertex , introduc…
cs.CG2021
Untangling Circular Drawings: Algorithms and Complexity
Sujoy Bhore, Guangping Li, Martin Nöllenburg +2
We consider the problem of untangling a given (non-planar) straight-line circular drawing of an outerplanar graph into a planar straight-line circular drawing by s…