13 citations · 23 across the 19 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Decomposing Triangulations into 4-Connected Components
Sabine Cornelsen, Gregor Diatzko
A connected graph is 4-connected if it contains at least five vertices and removing any three of them does not disconnect it. A frequent preprocessing step in graph drawing is to d…
cs.CG2023★ 1 cited
The Parametrized Complexity of the Segment Number
Sabine Cornelsen, Giordano Da Lozzo, Luca Grilli +3
Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph , the segment number of is the minimum number of…