Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthias Söls

dblp:342/3869 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Computational geometry · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › topological data analysis
persistent homology
1.722026
Fast Free Resolutions of Bifiltered Chain Complexes · SoCG 2026
The Localized Union-Of-Balls Bifiltration · SoCG 2023
Computational geometry
topological data analysis
1.722026
Fast Free Resolutions of Bifiltered Chain Complexes · SoCG 2026
The Localized Union-Of-Balls Bifiltration · SoCG 2023

Methods — techniques the papers use, named apart from their topics

algebraic topology · 1.0CGAL · 0.7
YearPublicationVenuePosition
2026 Fast Free Resolutions of Bifiltered Chain Complexes
Ulrich Bauer, Tamal K. Dey, Michael Kerber, Florian Russold, Matthias Söls
SoCG5
2023 The Localized Union-Of-Balls Bifiltration
abstract
We propose an extension of the classical union-of-balls filtration of persistent homology: fixing a point $q$, we focus our attention to a ball centered at $q$ whose radius is controlled by a second scale parameter. We discuss an absolute variant, where the union is just restricted to the $q$-ball, and a relative variant where the homology of the $q$-ball relative to its boundary is considered. Interestingly, these natural constructions lead to bifiltered simplicial complexes which are not $k$-critical for any finite $k$. Nevertheless, we demonstrate that these bifiltrations can be computed exactly and efficiently, and we provide a prototypical implementation using the CGAL library. We also argue that some of the recent algorithmic advances for $2$-parameter persistence (which usually assume $k$-criticality for some finite $k$) carry over to the $\infty$-critical case.
Michael Kerber, Matthias Söls
SoCG2