scientific article; zbMATH DE number 7764101
From MaRDI portal
Publication:6089654
Cites work
- A Polynomial Kernel for Diamond-Free Editing
- Claw-free graphs. IV: Decomposition theorem
- Dichotomy results on the hardness of H-free edge modification problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fundamentals of parameterized complexity
- Incompressibility of \(H\)-free edge modification problems
- Incompressibility of H-free edge modification problems: towards a dichotomy
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Parameterized algorithms
- Parameterized lower bound and improved kernel for diamond-free edge deletion
- Parametrized complexity theory.
- Paw-free graphs
- The node-deletion problem for hereditary properties is NP-complete
- Two edge modification problems without polynomial kernels
Cited in
(8)- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- On subgraph complementation to \(H\)-free Graphs
- On subgraph complementation to \(H\)-free graphs
- A Polynomial Kernel for Diamond-Free Editing
- Polynomial kernels for paw-free edge modification problems
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Polynomial kernel and incompressibility for prison-free edge deletion and completion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089654)
