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

Steffen Oppermann

dblp:297/5154 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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

Theory of computation · 1 · 1 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
1 paper
Computational geometry · 75% Graph algorithms and graph theory · 25%

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

TopicWeightPapersLastEvidence papers
Computational geometry › topological data analysis › persistent homology
multiparameter persistence
0.612022
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions · SoCG 2022
Computational geometry › topological data analysis
persistent homology
0.612022
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions · SoCG 2022
Graph algorithms and graph theory › graph theory › graph parameters › graph width parameters
rank decompositions
0.612022
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions · SoCG 2022
Computational geometry
topological data analysis
0.612022
Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions · SoCG 2022
YearPublicationVenuePosition
2022 Signed Barcodes for Multi-Parameter Persistence via Rank Decompositions
abstract
In this paper we introduce the signed barcode, a new visual representation of the global structure of the rank invariant of a multi-parameter persistence module or, more generally, of a poset representation. Like its unsigned counterpart in one-parameter persistence, the signed barcode encodes the rank invariant as a ℤ-linear combination of rank invariants of indicator modules supported on segments in the poset. It can also be enriched to encode the generalized rank invariant as a ℤ-linear combination of generalized rank invariants in fixed classes of interval modules. In the paper we develop the theory behind these rank decompositions, showing under what conditions they exist and are unique - so the signed barcode is canonically defined. We also illustrate the contribution of the signed barcode to the exploration of multi-parameter persistence modules through a practical example.
Magnus Bakke Botnan, Steffen Oppermann, Steve Oudot
SoCG2