On the stability of interval decomposable persistence modules H Bakke Bjerkevik
Discrete & Computational Geometry 66 (1), 92-121, 2021
69 * 2021 Computing the interleaving distance is NP-hard HB Bjerkevik, MB Botnan, M Kerber
Foundations of Computational Mathematics 20 (5), 1237-1271, 2020
57 2020 Computational complexity of the interleaving distance HB Bjerkevik, MB Botnan
arXiv preprint arXiv:1712.04281, 2017
36 2017 ℓp-distances on multiparameter persistence modules HB Bjerkevik, M Lesnick
arXiv preprint arXiv:2106.13589, 2021
14 2021 Asymptotic improvements on the exact matching distance for 2-parameter persistence HB Bjerkevik, M Kerber
arXiv preprint arXiv:2111.10303, 2021
9 2021 Quasi-universality of Reeb graph distances U Bauer, HB Bjerkevik, B Fluhr
38th International Symposium on Computational Geometry (SoCG 2022), 2022
8 2022 Stabilizing decomposition of multiparameter persistence modules HB Bjerkevik
arXiv preprint arXiv:2305.15550, 2023
2 2023 Stability and Complexity in Multi-Parameter Persistence HB Bjerkevik
NTNU, 2020
1 2020 Stability of persistence modules HB Bjerkevik
NTNU, 2016
1 2016 Computing -presentation distances is hard HB Bjerkevik, MB Botnan
arXiv preprint arXiv:2403.07200, 2024
2024 Computing -presentation distances is hard H Bakke Bjerkevik, M Bakke Botnan
arXiv e-prints, arXiv: 2403.07200, 2024
2024 38th International Symposium on Computational Geometry (SoCG 2022) X Goaoc, M Kerber, A Aamand, M Abrahamsen, T Ahle, PMR Rasmussen, ...
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2022
2022 Tighter Bounds for Reconstruction from -samples HB Bjerkevik
arXiv preprint arXiv:2112.03656, 2021
2021 Tight quasi-universality of Reeb graph distances U Bauer, H Bakke Bjerkevik, B Fluhr
arXiv e-prints, arXiv: 2112.00720, 2021
2021