Browsing Bergen Open Research Archive by Author "Stamoulis, Giannos"

Now showing items 1-6 of 6

    • An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL 

      Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2020)
      In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex removal, edge removal, edge contraction, or edge ...

    • An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL 

      Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
      In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex deletion, edge deletion, edge contraction, or ...

    • Combing a Linkage in an Annulus 

      Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
      A linkage in a graph 𝐺 of size 𝑘 is a subgraph 𝐿 of 𝐺 whose connected components are 𝑘 paths. The pattern of a linkage of size 𝑘 is the set of 𝑘 pairs formed by the endpoints of these paths. A consequence of the ...

    • Compound Logics for Modification Problems 

      Fomin, Fedor; Golovach, Petr; Sau, Ignasi; Stamoulis, Giannos; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
      We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with ...

    • Computing Paths of Large Rank in Planar Frameworks Deterministically 

      Fomin, Fedor; Golovach, Petr; Korhonen, Tuukka Matias Aleksanteri; Stamoulis, Giannos (Journal article; Peer reviewed, 2023)
      A framework consists of an undirected graph G and a matroid M whose elements correspond to the vertices of G. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing ...

    • Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable 

      Golovach, Petr; Thilikos, Dimitrios; Stamoulis, Giannos (Journal article; Peer reviewed, 2020)
      For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and an integer k and asks whether there exists a set S ⊆ V(G) with |S| ≤ k such that G \ S does not contain any of the graphs ...