Pages that link to "Item:Q1662097"
From MaRDI portal
The following pages link to Two edge modification problems without polynomial kernels (Q1662097):
Displayed 20 items.
- 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)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← 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)
- A Polynomial Kernel for Diamond-Free Editing (Q5009567) (← links)
- (Q5116487) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
- Dichotomy Results on the Hardness of $H$-free Edge Modification Problems (Q5346539) (← links)
- A Polynomial Kernel for Line Graph Deletion (Q5874512) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← 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 (Q6163958) (← links)