scientific article; zbMATH DE number 7764109
From MaRDI portal
Publication:6089665
DOI10.4230/lipics.ipec.2020.18zbMath1529.68217MaRDI QIDQ6089665
Venkatesh Raman, Ashwin Jacob, Diptapriyo Majumdar
Publication date: 13 November 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
Faster FPT algorithms for deletion to pairs of graph classes ⋮ Distance from triviality 2.0: hybrid parameterizations
Cites Work
- Parameterized complexity of vertex deletion into perfect graph classes
- Parameterized graph separation problems
- The node-deletion problem for hereditary properties is NP-complete
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Intersection statements for systems of sets
- Bivariate complexity analysis of \textsc{Almost Forest Deletion}
- Faster deterministic \textsc{Feedback Vertex Set}
- An improved parameterized algorithm for the minimum node multiway cut problem
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
- Parameterized Tractability of Multiway Cut with Parity Constraints
- An FPT algorithm for Tree Deletion Set
- Wheel-Free Deletion Is W[2-Hard]
- Node-Deletion Problems on Bipartite Graphs
- Graph Classes: A Survey
- Strong Parameterized Deletion: Bipartite Graphs
- Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
- Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
- Parameterized Algorithms
This page was built for publication:
