Alexander Leonhardt

activity

20242026

collaborators

4 papers

cs.CC2026

On the Complexity of the Minimum-( $k, ρ$ )-Shortcut Problem

Tatiana Rocha Avila, Julian Christoph Brinkmann, Alexander Leonhardt +1

We consider the Minimum- $(k, ρ)$ - $Shortcut$ problem ( $min (k, ρ) - Shortcut$ ), where the goal is to find the smallest set of shortcut edges such that every ver…

cs.DS2025

Revisiting a Successful Reduction Rule for Dominating Set

Lukas Geis, Alexander Leonhardt, Johannes Meintrup +3

Given a graph $G = (V, E)$ with $n$ vertices and $m$ edges, the DominatingSet problem asks for a set $D \subseteq V$ of minimal cardinality such that every vertex either is in $D$ …

cs.DS2024

Efficient Uniform Negative Edge Weights

Lukas Geis, Daniel Allendorf, Thomas Bläsius +4

We consider a maximum entropy edge weight model that allows for negative weights. Given a graph $G$ and possible weights $W$ typically consisting of positive and negative…

cs.DS2024

Insights into $(k, ρ)$ -shortcutting algorithms

Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck

A graph is called a $(k, ρ)$ -graph iff every node can reach $ρ$ of its nearest neighbors in at most k hops. This property proved useful in the analysis and design of parallel shorte…

On the Complexity of the Minimum-(k,ρ)-Shortcut Problem

Revisiting a Successful Reduction Rule for Dominating Set

Efficient Uniform Negative Edge Weights

Insights into (k,ρ)-shortcutting algorithms

On the Complexity of the Minimum-( $k, ρ$ )-Shortcut Problem

Insights into $(k, ρ)$ -shortcutting algorithms