Sebastian Angrick

collaborators

3 papers

cs.CG2026

Computing All Optimal Partial $p$ -Wasserstein Matchings on the Line

Sebastian Angrick, Jacobus Conradi, Mónika Csikós +5

For $p \geq 1$ , the $p$ -Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p…

cs.DS2026

String Matching in (Block) Graphs: A Full Classification by Walk Length

Sebastian Angrick, Ben Bals, Paweł Gawrychowski +2

We consider directed graphs in which the nodes are labeled with strings. A walk in such a graph naturally corresponds to the concatenation of the visited nodes' labels. These graph…

cs.CG2026

Computing $L_{\infty}$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness

Sebastian Angrick, Kevin Buchin, Geri Gokaj +1

To measure the shape similarity of point sets, various notions of the Hausdorff distance under translation are widely studied. In this context, for an $n$ -point set $P$ and $m$ -poi…

Computing All Optimal Partial p-Wasserstein Matchings on the Line

String Matching in (Block) Graphs: A Full Classification by Walk Length

Computing L∞​ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness

Computing All Optimal Partial $p$ -Wasserstein Matchings on the Line

Computing $L_{\infty}$ Hausdorff Distances Under Translations: The Interplay of Dimensionality, Symmetry and Discreteness