Gregor Diatzko

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

When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds. Two prominent parameters in this context are $c$-packedness and $\lambda$-low density, both of which locally restrict graph complexity. Parameterized algorithms based on these parameters have been...