(Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576): Difference between revisions

@@ Property / cites work @@
+Correlation clustering
@@ Property / cites work: Correlation clustering / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems
+Normal rank
@@ Property / cites work @@
+A golden ratio parameterized algorithm for cluster editing
+Normal rank
@@ Property / cites work @@
+NP-completeness results for edge modification problems
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Cluster editing: kernelization based on edge cuts
@@ Property / cites work: Cluster editing: kernelization based on edge cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2k\) kernel for the cluster editing problem
@@ Property / cites work: A \(2k\) kernel for the cluster editing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Editing Simple Graphs
@@ Property / cites work: Editing Simple Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Exploring the Subexponential Complexity of Completion Problems
+Normal rank
@@ Property / cites work @@
+A polynomial kernel for trivially perfect editing
@@ Property / cites work: A polynomial kernel for trivially perfect editing / rank @@
+Normal rank
@@ Property / cites work @@
+Q6168461
@@ Property / cites work: Q6168461 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for parameterized complexity of cluster editing with a small number of clusters
+Normal rank
@@ Property / cites work @@
+Kernelization
@@ Property / cites work: Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+On the relation of strong triadic closure and cluster deletion
+Normal rank
@@ Property / cites work @@
+Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
+Normal rank
@@ Property / cites work @@
+The splittance of a graph
@@ Property / cites work: The splittance of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Cluster editing with locally bounded modifications
+Normal rank
@@ Property / cites work @@
+Strong triadic closure in cographs and graphs of low maximum degree
+Normal rank
@@ Property / cites work @@
+Edge deletion problems: branching facilitated by modular decomposition
+Normal rank
@@ Property / cites work @@
+Complexity classification of some edge modification problems
+Normal rank
@@ Property / cites work @@
+Parameterizing edge modification problems above lower bounds
+Normal rank
@@ Property / cites work @@
+The Comparability Graph of a Tree
@@ Property / cites work: The Comparability Graph of a Tree / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-threshold graphs
@@ Property / cites work: Quasi-threshold graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank