Håvard Bakke Bjerkevik

Orcid: 0000-0001-9778-0354

According to our database1, Håvard Bakke Bjerkevik authored at least 14 papers between 2016 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Computing p-Presentation Distances is Hard.
Discret. Comput. Geom., June, 2026

Stabilizing Decomposition of Multiparameter Persistence Modules.
Found. Comput. Math., April, 2026

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds.
Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025
Reeb Graph of Sample Thickenings.
CoRR, December, 2025

Tight quasi-universality of Reeb graph distances.
J. Appl. Comput. Topol., March, 2025

Flipping Non-Crossing Spanning Trees.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2023
Asymptotic improvements on the exact matching distance for 2-parameter persistence.
J. Comput. Geom., 2023

2022
Tighter Bounds for Reconstruction from ε-Samples.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

Quasi-Universality of Reeb Graph Distances.
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
On the Stability of Interval Decomposable Persistence Modules.
Discret. Comput. Geom., 2021

𝓁<sup>p</sup>-Distances on Multiparameter Persistence Modules.
CoRR, 2021

2020
Computing the Interleaving Distance is NP-Hard.
Found. Comput. Math., 2020

2018
Computational Complexity of the Interleaving Distance.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2016
Stability of higher-dimensional interval decomposable persistence modules.
CoRR, 2016


  Loading...