Jan Arne Telle

Jan Arne Telle is a Professor in the Department of Informatics at the University of Bergen. His research focuses on algorithms, computational complexity, and graph theory, with recent contributions to explainable AI (XAI) and machine teaching. He leads the Norwegian Research Council-funded project 'Machine Teaching for Explainable AI' and has taught courses such as INF339 on Algorithmics of Causality.

His work spans graph algorithms, parameterized complexity, and combinatorial optimization, with notable contributions to graph decomposition techniques like mim-width, cliquewidth, and boolean-width. Collaborations include researchers from institutions like the University of Rostock and the University of Montpellier.

Key research trends include analyzing time series classification interpretability, optimizing robust simplifications for machine learning models, and solving combinatorial problems in machine teaching. Telle's algorithms for problems like Feedback Vertex Set and Perfect Matching Cut have advanced the field of parameterized complexity. Despite no listed awards, his extensive publication record reflects significant academic impact.

He is involved in the Algorithms Research Group at UiB and contributes to computational theory education and outreach, including participation in programming competitions and academic leadership roles.