Faster parameterized algorithms for modification problems to minor-closed classes
type: Item
instance of: scholarly article
title: Faster parameterized algorithms for modification problems to minor-closed classes
zbMATH Open document ID: 1547.05284
author: Laure Morelle
author: Ignasi Sau
author: Giannos Stamoulis
author: Dimitrios M. Thilikos
published in: TheoretiCS
publication date: 2024-09-10T00:00:00Z
Mathematics Subject Classification ID: 05C83
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7909970
zbMATH Keywords: graph minors
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: graph modification problems
zbMATH Keywords: vertex deletion
zbMATH Keywords: elimination distance
zbMATH Keywords: irrelevant vertex technique
zbMATH Keywords: flat Wall theorem
zbMATH Keywords: obstruction set
MaRDI profile type: Publication
cites work: Faster parameterized algorithms for minor containment
cites work: Q3579375
cites work: Irrelevant vertices for the planar disjoint paths problem
cites work: Deleting, eliminating and decomposing to hereditary classes are all FPT-equivalent
cites work: A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
cites work: On the Parameterized Complexity of Clique Elimination Distance
cites work: Optimal tree decompositions revisited: a simpler linear-time FPT algorithm
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
cites work: Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
cites work: Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms
cites work: Hitting minors on bounded treewidth graphs. III. Lower bounds
cites work: Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
cites work: Q4792909
cites work: Q4694712
cites work: Fixed-parameter tractable distances to sparse graph classes
cites work: Graph isomorphism parameterized by elimination distance to bounded degree
cites work: Sparse obstructions for minor-covering parameters
cites work: Parameterized Algorithms
cites work: Graph Theory
cites work: Fundamentals of parameterized complexity
cites work: Forbidden graphs for tree-depth
cites work: Measuring what matters: a hybrid approach to dynamic programming with treewidth
cites work: A unified treatment of linked and lean tree-decompositions
cites work: Parametrized complexity theory.
cites work: Compound logics for modification problems
cites work: Parameterized Complexity of Elimination Distance to First-Order Logic Properties
cites work: Hitting topological minors is FPT
cites work: A Menger-like property of tree-cut width
cites work: Cutwidth: obstructions and algorithmic aspects
cites work: Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
cites work: Combing a Linkage in an Annulus
cites work: Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes
cites work: Parameterized and Exact Computation
cites work: Which problems have strongly exponential complexity?
cites work: Vertex deletion parameterized by elimination distance and even less
cites work: A Near-Optimal Planarization Algorithm
cites work: Linear Rank-Width of Distance-Hereditary Graphs
cites work: Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
cites work: Planarity Allowing Few Error Vertices in Linear Time
cites work: Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
cites work: The disjoint paths problem in quadratic time
cites work: A new proof of the flat wall theorem
cites work: A shorter proof of the graph minor algorithm: the unique linkage theorem
cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
cites work: Q5091010
cites work: Treewidth. Computations and approximations
cites work: Deleting vertices to graphs of bounded genus
cites work: Q4273873
cites work: Q4000087
cites work: Upper bounds on the size of obstructions and intertwines
cites work: Q4036591
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Obtaining a planar graph by vertex deletion
cites work: Faster parameterized algorithms for modification problems to minor-closed classes
cites work: Sparsity. Graphs, structures, and algorithms
cites work: Q5710169
cites work: AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: A Faster Parameterized Algorithm for Treedepth

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: Graph minors. V. Excluding a planar graph

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: Graph minors. XIII: The disjoint paths problem

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: Graph minors. XVI: Excluding a non-planar graph

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: Graph minors. XX: Wagner's conjecture

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: Graph minors. XXI. graphs with unique linkages

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: Graph minors. XXII. Irrelevant vertices in linkage problems

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: A Menger-like property of tree-width: The finite case

Faster parameterized algorithms for modification problems to minor-closed classes (cites work)
cites work: The extremal function for complete minors

Faster parameterized algorithms for modification problems to minor-closed classes (DOI)
DOI: 10.46298/THEORETICS.24.19