The Network Diversion Problem

Professor Pål Grønås Drange of the University of Bergen introduces **Parameterized Complexity**, a framework for tackling difficult computational problems by focusing on structural features that can make them more manageable. Using the **network diversion problem**, he explores how this approach can reveal vulnerabilities and weak points in real-world networks, from road and utility systems to critical infrastructure like gas pipelines.

Guest

Pål Grønås Drange: Pål Grønås Drange is an associate professor in algorithms at the Department of Informatics, University of Bergen, Norway. He holds a diploma in electronics, a bachelor's in cognitive science, a master's in logic/AI, and a PhD in algorithms where his focus was parameterized graph modification algorithms. Before returning to academia, Drange spent several years in industry as a developer and advisor working on mathematical modeling, simulation, forecasting, and machine learning. His research centers on algorithmic solutions for graph modification and network vulnerability, especially under parameterized and sparse-network regimes. He explores how networks can be efficiently transformed to uncover structure or expose vulnerabilities. Beyond research, he earned the 2024 Faculty Outreach Award for science communication, recognized for delivering around 40 talks to varied audiences, from policymakers to high school students, on AI and its societal implications.