Browsing Department of Informatics by Author "Arrighi, Emmanuel Jean Paul Pierre"

Now showing items 1-5 of 5

    • 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 ...

    • On the Complexity of Intersection Non-emptiness for Star-Free Language Classes 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Hoffmann, Stefan; Holzer, Markus; Jecker, Ismaël; Oliveira, Mateus De Oliveira; Wolf, Petra (Journal article; Peer reviewed, 2021)
      In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the ...

    • 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 ...

    • Order Reconfiguration Under Width Constraints 

      Arrighi, Emmanuel Jean Paul Pierre; Fernau, Henning; Oliveira, Mateus De Oliveira; Wolf, Petra (Journal article; Peer reviewed, 2021)
      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 ...