Erlend Raa Vågset

According to our database, Erlend Raa Vågset authored at least 5 papers between 2019 and 2026.

Collaborative distances:

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

2026

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes.

Geevarghese Philip, Erlend Raa Vågset

Proceedings of the 42nd International Symposium on Computational Geometry, 2026

2025

Homology localization through the looking-glass of parameterized complexity theory.

Nello Blaser, Erlend Raa Vågset

J. Appl. Comput. Topol., June, 2025

2024

The parameterized complexity of finding minimum bounded chains.

Nello Blaser, Morten Brun, Lars M. Salbu, Erlend Raa Vågset

Comput. Geom., 2024

2022

ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth.

Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset

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

2019

Linear MIM-Width of Trees.

Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019