Erlend Raa Vågset
Field of work
Homepage Google Scholar ORCID
My research, in a nutshell
I am a mathematical computer scientist. I study what makes computational problems hard, when they can be solved efficiently, and how mathematical structure can lead to better algorithms. My research spans algorithms, machine learning and combinatorial topology, especially parameterized complexity and topological data analysis. I am also interested in developing and testing algorithms and exploring applications in data analysis, optimization, robotics and other fields. I am always happy to discuss new ideas and possible collaborations, including those that take me outside my usual areas.

My teaching philosophy
I draw inspiration from the principles of democratic education, with an emphasis on freedom, community, and shared responsibility. I believe learning is a social process, shaped by discussion, cooperation, and the freedom to pursue one's own questions. As AI makes it easier to carry out many tasks, I think it becomes more important to develop the judgement to decide what is worth doing in the first place. In teaching and supervision, I try to put these ideas into practice by involving students in decisions, encouraging them to work together, and giving them space to take their own ideas seriously.

Does this actually work?
It seems so. For instance, my collaboration with Thobias Kvalvik Høivik began when he was halfway through the second year of his bachelor's degree. His interest in a game called Paper Soccer got us started. One question led to another, and eventually to a paper at ESA 2026 (the leading European conference on algorithms) answering a mathematical question that had been open for over 30 years. Along the way, Thobias received a StudentForsk grant and HVL's 2026 student research award.
Links and resources:
Research:
Discrete models of topological spaces · Topology and high-dimensional data · Parameterized complexity
Teaching and education:
Teaching methods · Educational traditions · Democratic education
Student research:
Thobias Kvalvik Høivik · Paper Soccer · ESA 2026 paper · HVL news article
Media:
"Åpen dag" (for UiB) · Drop-in · Paper Soccer
Public feedback from students:
Jobjørn · Siri · Sondre
Publications
-
Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width
-
ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
-
Students’ use of learning videos
-
Homology localization through the looking-glass of parameterized complexity theory
-
Optimal Parameterized Algorithms for Solving NP-Hard Problems in Topology