Håvard Bakke Bjerkevik

19 papers A* 4Journal 15

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds. CoRR Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2025	A*	`conf`	Flipping Non-Crossing Spanning Trees. SODA Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2025	J	`jnl`	Reeb Graph of Sample Thickenings. CoRR Håvard Bakke Bjerkevik, Nello Blaser, Lars M. Salbu
2025	J	`jnl`	Tight quasi-universality of Reeb graph distances. J. Appl. Comput. Topol. Ulrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr
2024	J	`jnl`	Computing p-presentation distances is hard. CoRR Håvard Bakke Bjerkevik, Magnus Bakke Botnan
2024	J	`jnl`	Flipping Non-Crossing Spanning Trees. CoRR Håvard Bakke Bjerkevik, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
2023	J	`jnl`	Asymptotic improvements on the exact matching distance for 2-parameter persistence. J. Comput. Geom. Håvard Bakke Bjerkevik, Michael Kerber
2022	A*	`conf`	Quasi-Universality of Reeb Graph Distances. SoCG Ulrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr
2022	A*	`conf`	Tighter Bounds for Reconstruction from ε-Samples. SoCG Håvard Bakke Bjerkevik
2021	J	`jnl`	Asymptotic Improvements on the Exact Matching Distance for 2-parameter Persistence. CoRR Håvard Bakke Bjerkevik, Michael Kerber
2021	J	`jnl`	On the Stability of Interval Decomposable Persistence Modules. Discret. Comput. Geom. Håvard Bakke Bjerkevik
2021	J	`jnl`	Quasi-universality of Reeb graph distances. CoRR Ulrich Bauer, Håvard Bakke Bjerkevik, Benedikt Fluhr
2021	J	`jnl`	Tighter bounds for reconstruction from ε-samples. CoRR Håvard Bakke Bjerkevik
2021	J	`jnl`	𝓁 CoRR Håvard Bakke Bjerkevik, Michael Lesnick
2020	J	`jnl`	Computing the Interleaving Distance is NP-Hard. Found. Comput. Math. Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber
2018	A*	`conf`	Computational Complexity of the Interleaving Distance. SoCG Håvard Bakke Bjerkevik, Magnus Bakke Botnan
2018	J	`jnl`	Computing the interleaving distance is NP-hard. CoRR Håvard Bakke Bjerkevik, Magnus Bakke Botnan, Michael Kerber
2017	J	`jnl`	Computational Complexity of the Interleaving Distance. CoRR Håvard Bakke Bjerkevik, Magnus Bakke Botnan
2016	J	`jnl`	Stability of higher-dimensional interval decomposable persistence modules. CoRR Håvard Bakke Bjerkevik