Pages that link to "Item:Q2343091"

The following pages link to Incompressibility of \(H\)-free edge modification problems (Q2343091):

Displaying 24 items.

• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
• A polynomial kernel for trivially perfect editing (Q1799208) (← links)
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy (Q2071824) (← links)
• A polynomial kernel for diamond-free editing (Q2072105) (← links)
• On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
• Parameterized aspects of strong subgraph closure (Q2182097) (← links)
• On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
• Two edge-disjoint paths with length constraints (Q2330117) (← links)
• Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
• Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
• On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
• Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
• Finding Two Edge-Disjoint Paths with Length Constraints (Q3181047) (← links)
• Parameterized Lower Bound and NP-Completeness of Some H-Free Edge Deletion Problems (Q3467861) (← links)
• A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
• (Q5116487) (← links)
• Dichotomy Results on the Hardness of $H$-free Edge Modification Problems (Q5346539) (← links)
• A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
• (Q5874544) (← links)
• (Q6089654) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)