1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2026
-Packedness versus -Low-Density in Geometric Graphs: Theory and Practice
Gregor Diatzko, Félix Lasseux, Sabine Storandt
When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds. Two prominent parameters in this context are -packedn…
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.CG2022★ 1 cited
Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
Sabine Cornelsen, Gregor Diatzko
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical s…