scientific article; zbMATH DE number 7651211

DOI10.4230/LIPICS.ESA.2020.72MaRDI QIDQ5874544FDOQ5874544

R. B. Sandeep, Dániel Marx

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

incompressibilityH-free graphsedge modification problems

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed-parameter tractability of graph modification problems for hereditary properties
• The node-deletion problem for hereditary properties is NP-complete
• Parameterized Algorithms
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Node-Deletion Problems on Bipartite Graphs
• Chordal editing is fixed-parameter tractable
• Edge-Deletion Problems
• Cluster editing: kernelization based on edge cuts
• On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
• Kernelization
• Incompressibility of \(H\)-free edge modification problems
• Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of H-free Edge Modification Problems
• Polynomial kernelization for removing induced claws and diamonds
• A Polynomial Kernel for Diamond-Free Editing
• Dichotomy Results on the Hardness of $H$-free Edge Modification Problems

Cited In (2)

• Title not available (Why is that?)
• Kernel for \(K_t\)\textsc{-free Edge Deletion}

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 Q5874544)