2 citations · 3 across the 4 of their papers we have counts for
4 papers · 1 filter
Overlapping Biclustering
Matthias Bentert, Pål Grønås Drange, Erlend Haugen
We study the problem of transforming bipartite graphs into bicluster graphs. Abu-Khzam, Isenmann, and Merchad [IWOCA '25] introduced two variants of this problem. In both problems,…
Planar Network Diversion
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin +1
Network Diversion is a graph problem that has been extensively studied in both the network-analysis and operations-research communities as a measure of how robust a network is agai…
Two-sets cut-uncut on planar graphs
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin +2
We study the following Two-Sets Cut-Uncut problem on planar graphs. Therein, one is given an undirected planar graph and two sets of vertices and . The question is, what…
A survey of parameterized algorithms and the complexity of edge modification
Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin +1
The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is…