• Cluster Editing with Overlapping Communities 

      Arrighi, Emmanuel Jean Paul Pierre; Bentert, Matthias; Drange, Pål Grønås; Sullivan, Blair D.; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2023)
      Cluster Editing, also known as correlation clustering, is a well-studied graph modification problem. In this problem, one is given a graph and allowed to perform up to k edge additions and deletions to transform it into a ...
    • Kernelizing Temporal Exploration Problems 

      Arrighi, Emmanuel Jean Paul Pierre; Fomin, Fedor; Golovach, Petr; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2023)
      We study the kernelization of exploration problems on temporal graphs. A temporal graph consists of a finite sequence of snapshot graphs 𝒢 = (G₁, G₂, … , G_L) that share a common vertex set but might have different edge ...
    • Learning from positive and negative examples: New proof for binary alphabets 

      Lingg, Jonas; De Oliveira Oliveira, Mateus; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2024)
      One of the most fundamental problems in computational learning theory is the problem of learning a finite automaton A consistent with a finite set P of positive examples and with a finite set N of negative examples. By ...
    • Order Reconfiguration under Width Constraints 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; De Oliveira Oliveira, Mateus; Wolf, Petra Henrike Karola (Journal article; Peer reviewed, 2023)
      In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in ...