FPT algorithms to compute the elimination distance to bipartite graphs and more
From MaRDI portal
Publication:2672425
DOI10.1007/978-3-030-86838-3_6OpenAlexW3202334902MaRDI QIDQ2672425
Jari J. H. de Kroon, Bart M. P. Jansen
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2106.04191
Related Items
Distance from triviality 2.0: hybrid parameterizations, Deletion to scattered graph classes. I: Case of finite number of graph classes
Cites Work
- Unnamed Item
- Graph isomorphism parameterized by elimination distance to bounded degree
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Fundamentals of parameterized complexity
- Sparsity. Graphs, structures, and algorithms
- Finding odd cycle transversals.
- Graph minors. XIII: The disjoint paths problem
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Treewidth computation and extremal combinatorics
- Fixed-parameter tractable distances to sparse graph classes
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Isomorphism for Graphs of Bounded Feedback Vertex Set Number
- Graph Layout Problems Parameterized by Vertex Cover
- Graph Classes: A Survey
- Combining Treewidth and Backdoors for CSP.
- Reducing CMSO model checking to highly connected graphs
- Elimination Distance to Bounded Degree on Planar Graphs
- A Faster Parameterized Algorithm for Treedepth
- Parameterized and Exact Computation
- Parameterized Algorithms
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Elimination distances, blocking sets, and kernels for Vertex Cover
- Vertex deletion parameterized by elimination distance and even less
- On the Parameterized Complexity of Clique Elimination Distance
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
