• 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; 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 ...
    • Width Notions for Ordering-Related Problems 

      Arrighi, Emmanuel; Fernau, Henning; De Oliveira Oliveira, Mateus; Wolf, Petra (Journal article; Peer reviewed, 2020)
      We are studying a weighted version of a linear extension problem, given some finite partial order ρ, called Completion of an Ordering. While this problem is NP-complete, we show that it lies in FPT when parameterized by ...