University of Bergen

research

∙ 03/01/2022

Explainability for identification of vulnerable groups in machine learning models

If a prediction model identifies vulnerable individuals or groups, the u...

Inga Strumke, et al. ∙

research

∙ 03/31/2022

rfPhen2Gen: A machine learning based association study of brain imaging phenotypes to genotypes

Imaging genetic studies aim to find associations between genetic variant...

Muhammad Ammar Malik, et al. ∙

research

∙ 04/21/2022

Automated detection of dark patterns in cookie banners: how to do it poorly and why it is hard to do it any other way

Cookie banners, the pop ups that appear to collect your consent for data...

Than Htut Soe, et al. ∙

research

∙ 08/24/2017

Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense co

We address a problem of area protection in graph-based scenarios with mu...

Marika Ivanová, et al. ∙

research

∙ 07/28/2017

Simplified Energy Landscape for Modularity Using Total Variation

Networks capture pairwise interactions between entities and are frequent...

Zachary Boyd, et al. ∙

research

∙ 05/09/2017

Signal reconstruction via operator guiding

Signal reconstruction from a sample using an orthogonal projector onto a...

Andrew Knyazev, et al. ∙

research

∙ 06/27/2016

True Lies

A true lie is a lie that becomes true when announced. In a logic of anno...

Thomas Ågotnes, et al. ∙

research

∙ 06/24/2016

Resolving Distributed Knowledge

Distributed knowledge is the sum of the knowledge in a group; what someo...

Thomas Ågotnes, et al. ∙

research

∙ 12/01/2015

Accelerated graph-based nonlinear denoising filters

Denoising filters, such as bilateral, guided, and total variation filter...

Andrew Knyazev, et al. ∙

research

∙ 03/01/1999

An Algebraic Programming Style for Numerical Software and its Optimization

The abstract mathematical theory of partial differential equations (PDEs...

T. B. Dinesh, et al. ∙

research

∙ 06/18/2012

The Ultrasound Visualization Pipeline - A Survey

Ultrasound is one of the most frequently used imaging modality in medici...

Åsmund Birkeland, et al. ∙

research

∙ 12/11/2017

How to navigate through obstacles?

Given a set of obstacles and two points, is there a path between the two...

Eduard Eiben, et al. ∙

research

∙ 11/14/2017

A note on the complexity of Feedback Vertex Set parameterized by mim-width

We complement the recent algorithmic result that Feedback Vertex Set is ...

Lars Jaffke, et al. ∙

research

∙ 10/30/2017

The univalence axiom in cubical sets

In this note we show that Voevodsky's univalence axiom holds in the mode...

Marc Bezem, et al. ∙

research

∙ 10/30/2017

Finding Connected Secluded Subgraphs

Problems related to finding induced subgraphs satisfying given propertie...

Petr A. Golovach, et al. ∙

research

∙ 09/27/2017

On the tractability of optimization problems on H-graphs

For a graph H, a graph G is an H-graph if it is an intersection graph of...

Fedor V. Fomin, et al. ∙

research

∙ 02/20/2017

Heterogeneity Preserving Upscaling for Heat Transport in Fractured Geothermal Reservoirs

In simulation of fluid injection in fractured geothermal reservoirs, the...

Anna Nissen, et al. ∙

research

∙ 11/10/2017

Clustering with Local Restrictions

We study a family of graph clustering problems where each cluster has to...

Daniel Lokshtanov, et al. ∙

research

∙ 07/17/2017

On Treewidth and Stable Marriage

Stable Marriage is a fundamental problem to both computer science and ec...

Sushmita Gupta, et al. ∙

research

∙ 07/09/2017

The complexity of independent set reconfiguration on bipartite graphs

We settle the complexity of the Independent Set Reconfiguration problem ...

Daniel Lokshtanov, et al. ∙

research

∙ 01/29/2018

A Unifying Framework for Manipulation Problems

Manipulation models for electoral systems are a core research theme in s...

Dušan Knop, et al. ∙

research

∙ 02/05/2018

Reducing CMSO Model Checking to Highly Connected Graphs

Given a Counting Monadic Second Order (CMSO) sentence ψ, the CMSO[ψ] pro...

Daniel Lokshtanov, et al. ∙

research

∙ 02/22/2018

Complexity of the Steiner Network Problem with Respect to the Number of Terminals

In the Directed Steiner Network problem we are given an arc-weighted dig...

Eduard Eiben, et al. ∙

research

∙ 02/25/2018

Evaluating and Tuning n-fold Integer Programming

In recent years, algorithmic breakthroughs in stringology, computational...

Kateřina Altmanová, et al. ∙

research

∙ 02/28/2018

Parameterized Aspects of Strong Subgraph Closure

Motivated by the role of triadic closures in social networks, and the im...

Petr A. Golovach, et al. ∙

research

∙ 03/09/2018

Generalized distance domination problems and their complexity on graphs of bounded mim-width

We generalise the family of (σ, ρ)-problems and locally checkable vertex...

Lars Jaffke, et al. ∙

research

∙ 03/12/2018

Partitioning a graph into degenerate subgraphs

Let G = (V, E) be a graph with maximum degree k≥ 3 distinct from K_k+1. ...

Faisal N. Abu-Khzam, et al. ∙

research

∙ 03/25/2018

Popular Matching in Roommates Setting is NP-hard

An input to the Popular Matching problem, in the roommates setting, cons...

Sushmita Gupta, et al. ∙

research

∙ 04/19/2018

Finite Biased Teaching with Infinite Concept Classes

We investigate the teaching of infinite concept classes through the effe...

Jose Hernandez-Orallo, et al. ∙

research

∙ 04/29/2018

Partial complementation of graphs

A partial complement of the graph G is a graph obtained from G by comple...

Fedor V. Fomin, et al. ∙

research

∙ 05/04/2018

A New Perspective on FO Model Checking of Dense Graph Classes

We study the first-order (FO) model checking problem of dense graphs, na...

Jakub Gajarsky, et al. ∙

research

∙ 05/11/2018

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties

We consider the problems of deciding whether an input graph can be modif...

Fedor V. Fomin, et al. ∙

research

∙ 06/05/2018

Fast Dynamic Programming on Graph Decompositions

In this paper, we consider tree decompositions, branch decompositions, a...

Johan M. M. van Rooij, et al. ∙

research

∙ 09/22/2018

A 2-Approximation Algorithm for Feedback Vertex Set in Tournaments

A tournament is a directed graph T such that every pair of vertices is ...

Daniel Lokshtanov, et al. ∙

research

∙ 10/01/2018

Towards Cereceda's conjecture for planar graphs

The reconfiguration graph R_k(G) of the k-colourings of a graph G has as...

Eduard Eiben, et al. ∙

research

∙ 10/10/2018

Classifying k-Edge Colouring for H-free Graphs

A graph is H-free if it does not contain an induced subgraph isomorphic ...

Esther Galby, et al. ∙

research

∙ 10/16/2018

Randomized contractions meet lean decompositions

The randomized contractions technique, introduced by Chitnis et al. in 2...

Marek Cygan, et al. ∙

research

∙ 10/31/2018

Generation of random chordal graphs using subtrees of a tree

Chordal graphs form one of the most studied graph classes. Several graph...

Oylum Şeker, et al. ∙

research

∙ 11/19/2018

EFSIS: Ensemble Feature Selection Integrating Stability

Ensemble learning that can be used to combine the predictions from multi...

Xiaokang Zhang, et al. ∙

research

∙ 12/11/2018

Building Jiminy Cricket: An Architecture for Moral Agreements Among Stakeholders

An autonomous system is constructed by a manufacturer, operates in a soc...

Beishui Liao, et al. ∙

research

∙ 01/07/2019

On the Parameterized Complexity of k-Edge Colouring

For every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-p...

Esther Galby, et al. ∙

research

∙ 02/06/2019

Reconfiguring 10-colourings of planar graphs

Let k ≥ 1 be an integer. The reconfiguration graph R_k(G) of the k-colou...

Carl Feghali, et al. ∙

research

∙ 02/19/2019

Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals

Perturbed graphic matroids are binary matroids that can be obtained from...

Fedor V. Fomin, et al. ∙

research

∙ 02/21/2019

Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs

The reconfiguration graph R_k(G) of the k-colourings of a graph G contai...

Carl Feghali, et al. ∙

research

∙ 02/23/2019

Slightly Superexponential Parameterized Problems

A central problem in parameterized algorithms is to obtain algorithms ...

Daniel Lokshtanov, et al. ∙

research

∙ 03/04/2019

Decomposition of Map Graphs with Applications

Bidimensionality is the most common technique to design subexponential-t...

Fedor V. Fomin, et al. ∙

research

∙ 03/05/2019

Reducing the domination number of graphs via edge contractions

In this paper, we study the following problem: given a connected graph G...

Esther Galby, et al. ∙

research

∙ 04/05/2019

Knot Diagrams of Treewidth Two

In this paper, we study knot diagrams for which the underlying graph has...

Hans L. Bodlaender, et al. ∙

research

∙ 04/12/2019

Low-rank binary matrix approximation in column-sum norm

We consider ℓ_1-Rank-r Approximation over GF(2), where for a binary m× n...

Fedor V. Fomin, et al. ∙

research

∙ 04/17/2019

A Brief Note on Single Source Fault Tolerant Reachability

Let G be a directed graph with n vertices and m edges, and let s ∈ V(G) ...

Daniel Lokshtanov, et al. ∙

University of Bergen

Featured Researchers