Håvard Bakke Bjerkevik

According to our database, Håvard Bakke Bjerkevik authored at least 11 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Tight quasi-universality of Reeb graph distances.

Ulrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr

J. Appl. Comput. Topol., March, 2025

Flipping Non-Crossing Spanning Trees.

Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Computing p-presentation distances is hard.

Håvard Bakke Bjerkevik, Magnus Bakke Botnan

CoRR, 2024

2023

Asymptotic improvements on the exact matching distance for 2-parameter persistence.

Håvard Bakke Bjerkevik, Michael Kerber

J. Comput. Geom., 2023

2022

Tighter Bounds for Reconstruction from ε-Samples.

Håvard Bakke Bjerkevik

Proceedings of the 38th International Symposium on Computational Geometry, 2022

Quasi-Universality of Reeb Graph Distances.

Ulrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

On the Stability of Interval Decomposable Persistence Modules.

Håvard Bakke Bjerkevik

Discret. Comput. Geom., 2021

𝓁^p-Distances on Multiparameter Persistence Modules.

Håvard Bakke Bjerkevik, Michael Lesnick

CoRR, 2021

2020

Computing the Interleaving Distance is NP-Hard.

Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber

Found. Comput. Math., 2020

2018

Computational Complexity of the Interleaving Distance.

Håvard Bakke Bjerkevik, Magnus Bakke Botnan

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2016

Stability of higher-dimensional interval decomposable persistence modules.

Håvard Bakke Bjerkevik

CoRR, 2016