Stability of higher-dimensional interval decomposable persistence modules. - Håvard Bakke Bjerkevik (CoRR, 2016)

Computational Complexity of the Interleaving Distance. - Håvard Bakke Bjerkevik; Magnus Bakke Botnan (SoCG, 2018)

Computing the Interleaving Distance is NP-Hard. - Håvard Bakke Bjerkevik; Magnus Bakke Botnan; Michael Kerber (Found. Comput. Math., 2020)

𝓁p-Distances on Multiparameter Persistence Modules. - Håvard Bakke Bjerkevik; Michael Lesnick (CoRR, 2021)

On the Stability of Interval Decomposable Persistence Modules. - Håvard Bakke Bjerkevik (Discret. Comput. Geom., 2021)

Quasi-Universality of Reeb Graph Distances. - Ulrich Bauer; Håvard Bakke Bjerkevik; Benedikt Fluhr (SoCG, 2022)

Tighter Bounds for Reconstruction from ε-Samples. - Håvard Bakke Bjerkevik (SoCG, 2022)

Asymptotic improvements on the exact matching distance for 2-parameter persistence. - Håvard Bakke Bjerkevik; Michael Kerber (J. Comput. Geom., 2023)

Computing p-presentation distances is hard. - Håvard Bakke Bjerkevik; Magnus Bakke Botnan (CoRR, 2024)

Flipping Non-Crossing Spanning Trees. - Håvard Bakke Bjerkevik; Linda Kleist; Torsten Ueckerdt; Birgit Vogtenhuber (SODA, 2025)

Tight quasi-universality of Reeb graph distances. - Ulrich Bauer; Håvard Bakke Bjerkevik; Benedikt Fluhr (J. Appl. Comput. Topol., 2025)