scientific article; zbMATH DE number 7651211

DOI10.4230/LIPIcs.ESA.2020.72MaRDI QIDQ5874544

R. B. Sandeep, Dániel Marx

Publication date: 7 February 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

incompressibilityH-free graphsedge modification problems

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Kernel for \(K_t\)\textsc{-free Edge Deletion} ⋮ Unnamed Item

Cites Work

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

This page was built for publication: