Abstract
In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be
- [1] . 2011. Tight bounds for linkages in planar graphs. In Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 6755. Springer, 110–121.
DOI: Google ScholarCross Ref
- [2] . 2018. Approximation algorithms for Euler genus and related problems. SIAM Journal on Computing 47, 4 (2018), 1610–1643.
DOI: Google ScholarDigital Library
- [3] . 2011. An algorithm for the graph crossing number problem. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). ACM, New York, NY, 303–312.
DOI: Google ScholarDigital Library
- [4] . 2011. On graph crossing number and edge planarization. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 1050–1069.
DOI: Google ScholarCross Ref
- [5] . 1990. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85, 1 (1990), 12–75.
DOI: Google ScholarDigital Library
- [6] . 1992. The monadic second-order logic of graphs III: Tree-decompositions, minor and complexity issues. Informatique Théorique et Applications 26 (1992), 257–286.
DOI: Google ScholarCross Ref
- [7] . 2012. Graph Structure and Monadic Second-Order Logic—A Language-Theoretic Approach.
Encyclopedia of Mathematics and Its Applications , Vol. 138. Cambridge University Press. https://www.labri.fr/perso/courcell/Book/TheBook.pdf.Google ScholarDigital Library
- [8] . 2007. Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory: Series B 97, 1 (2007), 91–126.
DOI: Google ScholarDigital Library
- [9] . 2013. The planar directed K-Vertex-Disjoint Paths problem is fixed-parameter tractable. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). IEEE, Los Alamitos, CA, 197–206.
DOI: Google ScholarDigital Library
- [10] . 2007. Locally excluding a minor. In Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS’07). IEEE, Los Alamitos, CA, 270–279.
DOI: Google ScholarDigital Library
- [11] . 2004. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics 18, 3 (2004), 501–511.
DOI: Google ScholarDigital Library
- [12] . 2013. Testing first-order properties for subclasses of sparse graphs. Journal of the ACM 60, 5 (2013), Article 36, 24 pages.
DOI: Google ScholarDigital Library
- [13] . 2001. Fixed-parameter tractability, definability, and model-checking. SIAM Journal on Computing 31, 1 (2001), 113–145.
DOI: Google ScholarDigital Library
- [14] . 2006. Parameterized Complexity Theory. Springer.
DOI: Google ScholarCross Ref
- [15] . 2011. Contraction obstructions for treewidth. Journal of Combinatorial Theory: Series B 101, 5 (2011), 302–314.
DOI: Google ScholarDigital Library
- [16] . 2001. Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48, 6 (2001), 1184–1206.
DOI: Google ScholarDigital Library
- [17] . 1982. On local and non-local properties. In Proceedings of the Herbrand Symposium.
Studies in Logic and the Foundations of Mathematics , Vol. 107. Elsevier, 105–135.DOI: Google ScholarCross Ref
- [18] . 2017. The parameterized complexity of graph cyclability. SIAM Journal on Discrete Mathematics 31, 1 (2017), 511–541.
DOI: Google ScholarDigital Library
- [19] . 2013. Obtaining planarity by contracting few edges. Theoretical Computer Science 476 (2013), 38–46.
DOI: Google ScholarDigital Library
- [20] . 2008. Logic, graphs, and algorithms. In Logic and Automata: History and Perspectives.
Texts in Logic and Games , Vol. 2. Amsterdam University Press, 357–422.Google Scholar - [21] . 2011. Finding topological subgraphs is fixed-parameter tractable. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). ACM, New York, NY, 479–488.
DOI: Google ScholarDigital Library
- [22] . 2017. Deciding first-order properties of nowhere dense graphs. Journal of the ACM 64, 3 (2017), Article 17, 32 pages.
DOI: Google ScholarDigital Library
- [23] . 2014. A near-optimal planarization algorithm. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 1802–1811.
DOI: Google ScholarCross Ref
- [24] . 2009. Planarity allowing few error vertices in linear time. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS’09). IEEE, Los Alamitos, CA, 639–648.
DOI: Google ScholarDigital Library
- [25] . 2011. Algorithmic meta-theorems. In Finite and Algorithmic Model Theory.
London Mathematical Society Lecture Note Series , Vol. 379. Cambridge University Press, 177–270.Google ScholarCross Ref
- [26] . 1980. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences 20, 2 (1980), 219–230.
DOI: Google ScholarCross Ref
- [27] . 2010. Can you beat treewidth?Theory of Computing 6, 1 (2010), 85–112.
DOI: Google ScholarCross Ref
- [28] . 2012. Obtaining a planar graph by vertex deletion. Algorithmica 62, 3–4 (2012), 807–822.
DOI: Google ScholarDigital Library
- [29] . 1986. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 3 (1986), 309–322.
DOI: Google ScholarCross Ref
- [30] . 1995. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory: Series B 63, 1 (1995), 65–110.
DOI: Google ScholarDigital Library
- [31] . 2004. Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory: Series B 92, 2 (2004), 325–357.
DOI: Google ScholarDigital Library
- [32] . 1996. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science 6, 6 (1996), 505–526.
DOI: Google ScholarCross Ref
Index Terms
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
Recommendations
Hardness of Approximation for H-free Edge Modification Problems
The H-free Edge Deletion problem asks, for a given graph G and integer k, whether it is possible to delete at most k edges from G to make it H-free—that is, not containing H as an induced subgraph. The H-free Edge Completion problem is defined similarly,...
Induced packing of odd cycles in planar graphs
An induced packing of odd cycles in a graph is a packing such that there is no edge in the graph between any two odd cycles in the packing. We prove that an induced packing of k odd cycles in an n-vertex graph can be found (if it exists) in time 2^O^(^k^...
Algorithmic aspects of 2-secure domination in graphs
AbstractLet G(V, E) be a simple, connected and undirected graph. A dominating set is called a 2-secure dominating set (2-SDS) in G, if for each pair of distinct vertices there exists a pair of distinct vertices such that ,






Comments