Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
From MaRDI portal
Publication:2676471
DOI10.1016/j.tcs.2022.08.025OpenAlexW4294862349MaRDI QIDQ2676471
Publication date: 27 September 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.08.025
Cites Work
- Unnamed Item
- Unnamed Item
- Graph minors. III. Planar tree-width
- A unified approximation algorithm for node-deletion problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Which problems have strongly exponential complexity?
- Deleting edges to restrict the size of an epidemic: a new application for treewidth
- On the NP-hardness of edge-deletion and -contraction problems
- Faster parameterized algorithms for deletion to split graphs
- Integer Programming with a Fixed Number of Variables
- Graph Layout Problems Parameterized by Vertex Cover
- Minkowski's Convex Body Theorem and Integer Programming
- On the hardness of approximating minimization problems
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
- Node-and edge-deletion NP-complete problems
- Parameterized Algorithms
- Independent set reconfiguration parameterized by modular-width
- Complexity classification of some edge modification problems
This page was built for publication: Further parameterized algorithms for the \(\mathcal{F}\)-free edge deletion problem
