Elimination distance to bounded degree on planar graphs preprint

DOI10.3233/FI-242175MaRDI QIDQ6593702zbMATH OpenFDO

Authors Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny

Publication date 27 August 2024

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-242175

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593702)