5 papers
Computing All Optimal Partial -Wasserstein Matchings on the Line
Sebastian Angrick, Jacobus Conradi, Mónika Csikós +5
For , the -Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p…
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…
Computing 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 -point set and -poi…
How to Reduce Temporal Cliques to Find Sparse Spanners
Sebastian Angrick, Ben Bals, Tobias Friedrich +7
Many real-world networks, such as transportation or trade networks, are dynamic in the sense that the edge set may change over time, but these changes are known in advance. This be…
Towards Explainable Real Estate Valuation via Evolutionary Algorithms
Sebastian Angrick, Ben Bals, Niko Hastrich +6
Human lives are increasingly influenced by algorithms, which therefore need to meet higher standards not only in accuracy but also with respect to explainability. This is especiall…