Pages that link to "Item:Q1034099"
From MaRDI portal
The following pages link to On problems without polynomial kernels (Q1034099):
Displaying 19 items.
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)
- Fine-grained complexity of safety verification (Q5919003) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- Polynomial Kernel for Interval Vertex Deletion (Q6075746) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- Multistage \(s-t\) path: confronting similarity with dissimilarity (Q6107891) (← links)
- Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
- Kernelization for feedback vertex set via elimination distance to a forest (Q6153475) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- What Is Known About Vertex Cover Kernelization? (Q6163635) (← links)
- A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
- A quasi-quadratic vertex-kernel for cograph edge editing (Q6611028) (← links)
- Minimum separator reconfiguration (Q6615312) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
- Probabilistically checkable arguments for all NP (Q6637335) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)
