Elimination distance to bounded degree on planar graphs preprint
From MaRDI portal
Publication:6593702
DOI10.3233/FI-242175MaRDI QIDQ6593702FDOQ6593702
Authors: Alexander Lindermayr, Sebastian Siebertz, Alexandre Vigny 
Publication date: 27 August 2024
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Cites Work
- Graph minors. XIII: The disjoint paths problem
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Rankings of Graphs
- Parameterized algorithms
- Graph minors. V. Excluding a planar graph
- Sparsity. Graphs, structures, and algorithms
- Parameterized and Exact Computation
- Kernelization using structural parameters on sparse graph classes
- Graph isomorphism parameterized by elimination distance to bounded degree
- Testing first-order properties for subclasses of sparse graphs
- Graph minors and parameterized algorithm design
- Towards tight(er) bounds for the excluded grid theorem
- Fixed-parameter tractable distances to sparse graph classes
- Block elimination distance
- A faster parameterized algorithm for treedepth
- 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
- On the Parameterized Complexity of Clique Elimination Distance
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6593702)
