Incompressibility of \(H\)-free edge modification problems (Q2343091): Difference between revisions

@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel bounds for disjoint cycles and disjoint paths
+Normal rank
@@ Property / cites work @@
+Strong normalization for non-structural subtyping via saturated sets
+Normal rank
@@ Property / cites work @@
+Incompressibility of H-Free Edge Modification
@@ Property / cites work: Incompressibility of H-Free Edge Modification / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Graph-modeled data clustering: Exact algorithms for clique generation
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
+Normal rank
@@ Property / cites work @@
+On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
+Normal rank
@@ Property / cites work @@
+Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
+Normal rank
@@ Property / cites work @@
+Two edge modification problems without polynomial kernels
+Normal rank