Gregor Diatzko

activity

20222026

most citedPlanar Confluent Orthogonal Drawings of 4-Modal Digraphs

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

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

$c$ -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 $c$ -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…

c-Packedness versus λ-Low-Density in Geometric Graphs: Theory and Practice

Decomposing Triangulations into 4-Connected Components

$c$ -Packedness versus $λ$ -Low-Density in Geometric Graphs: Theory and Practice