5 citations · 8 across the 3 of their papers we have counts for
7 papers
Efficient Computation of Image Persistence
Ulrich Bauer, Maximilian Schmahl
We present an algorithm for computing the barcode of the image of a morphisms in persistent homology induced by an inclusion of filtered finite-dimensional chain complexes. These a…
The complexity of high-dimensional cuts
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum - cut, the minimum multiway cut, and…
Parametrized Complexity of Expansion Height
Ulrich Bauer, Abhishek Rathod, Jonathan Spreer
Deciding whether two simplicial complexes are homotopy equivalent is a fundamental problem in topology, which is famously undecidable. There exists a combinatorial refinement of th…
Cotorsion torsion triples and the representation theory of filtered hierarchical clustering
Ulrich Bauer, Magnus B. Botnan, Steffen Oppermann +1
We give a full classification of representation types of the subcategories of representations of an rectangular grid with monomorphisms (dually, epimorphisms) in one o…
On the Metric Distortion of Embedding Persistence Diagrams into separable Hilbert spaces
Mathieu Carriere, Ulrich Bauer
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances…
Persistent Betti numbers of random Čech complexes
Ulrich Bauer, Florian Pausinger
We study the persistent homology of random Čech complexes. Generalizing a method of Penrose for studying random geometric graphs, we first describe an appropriate theoretical frame…