EDBT 2026 Demo / reviewers in the wild / expert
Tim Mayr
dblp:439/8456
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › topological data analysis › persistent homology › multiparameter persistence
multicover bifiltration |
1.0 | 1 | 2026 | Persistence Meets Resistance: Doubling down on Hardness · ICALP 2026 |
Computational geometry › topological data analysis › persistent homology
multiparameter persistence |
1.0 | 1 | 2026 | Persistence Meets Resistance: Doubling down on Hardness · ICALP 2026 |
Computational geometry
topological data analysis |
1.0 | 1 | 2026 | Persistence Meets Resistance: Doubling down on Hardness · ICALP 2026 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Persistence Meets Resistance: Doubling down on HardnessabstractGiven a finite set A ⊂ ℝ^d, let Cov_{r,k} denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors as well. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. Benedikt Kolbe, Tim Mayr |
ICALP | 2 |