Elimination distance to bounded degree on planar graphs preprint

DOI10.3233/fi-242175MaRDI QIDQ6593702

Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny

Publication date: 27 August 2024

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Graph isomorphism parameterized by elimination distance to bounded degree
• Kernelization using structural parameters on sparse graph classes
• Sparsity. Graphs, structures, and algorithms
• Graph minors. V. Excluding a planar graph
• Graph minors. XIII: The disjoint paths problem
• Towards tight(er) bounds for the excluded grid theorem
• Fixed-parameter tractable distances to sparse graph classes
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Graph Minors and Parameterized Algorithm Design
• Rankings of Graphs
• Deciding First-Order Properties of Nowhere Dense Graphs
• A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
• Parameterized Complexity of Elimination Distance to First-Order Logic Properties
• Elimination Distance to Bounded Degree on Planar Graphs
• Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
• A Faster Parameterized Algorithm for Treedepth
• Parameterized and Exact Computation
• Testing first-order properties for subclasses of sparse graphs
• Parameterized Algorithms
• Block elimination distance
• On the Parameterized Complexity of Clique Elimination Distance
• First-order Logic with Connectivity Operators
• SAT backdoors: depth beats size
• Algorithms and data structures for first-order logic with connectivity under vertex failures

This page was built for publication: Elimination distance to bounded degree on planar graphs preprint