Pages that link to "Item:Q1949740"
From MaRDI portal
The following pages link to On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740):
Displaying 31 items.
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- 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)
- Linear-time minimal cograph editing (Q2140496) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← 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)
- On the computational complexity of the bipartizing matching problem (Q2675722) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
- Fractals for Kernelization Lower Bounds (Q4609787) (← links)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- (Q5874544) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Polynomial kernels for paw-free edge modification problems (Q5919117) (← links)
- (Q6089654) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
- A quasi-quadratic vertex-kernel for cograph edge editing (Q6611028) (← links)
