30 citations · 157 across the 83 of their papers we have counts for
5 papers · 2 filters
Compound Logics for Modification Problems
Fedor V. Fomin, Petr A. Golovach, Ignasi Sau +2
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 framew…
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
Fedor V. Fomin, Petr A. Golovach, Giannos Stamoulis +1
In general, a graph modification problem is defined by a graph modification operation and a target graph property . Typically, the modification operation $\bo…
A Constant-factor Approximation for Weighted Bond Cover
Eun Jung Kim, Euiwoong Lee, Dimitrios M. Thilikos
The Weighted -Vertex Deletion for a class of graphs asks, weighted graph , for a minimum weight vertex set such that The case when…
Hitting minors on bounded treewidth graphs. III. Lower bounds
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION problem consists in, given a graph and an integer , decide whether there exists wi…
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
Julien Baste, Ignasi Sau, Dimitrios M. Thilikos
For a finite collection of graphs , the -M-DELETION (resp. -TM-DELETION) problem consists in, given a graph and an integer , decide whether the…