Pages that link to "Item:Q3656868"
From MaRDI portal
The following pages link to Two Edge Modification Problems without Polynomial Kernels (Q3656868):
Displayed 22 items.
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs (Q713308) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses (Q5501928) (← links)
- (Q5743378) (← links)
- (Q5743380) (← links)
- (Q5743381) (← links)