3 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
3 papers · 1 filter
A Combinatorial -time Algorithm for the Min-Cost Flow Problem
Ruben Becker, Andreas Karrenbauer
We present a combinatorial method for the min-cost flow problem and prove that its expected running time is bounded by . This matches the best known bounds, whic…
Distributed computation of persistent homology
Ulrich Bauer, Michael Kerber, Jan Reininghaus
Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation…
Approximate Cech Complexes in Low and High Dimensions
Michael Kerber, R. Sharathkumar
Čech complexes reveal valuable topological information about point sets at a certain scale in arbitrary dimensions, but the sheer size of these complexes limits their practical imp…