Rank reduction of oriented graphs by vertex and edge deletions (Q722520): Difference between revisions

@@ Property / cites work @@
+A kernelization algorithm for \(d\)-hitting set
@@ Property / cites work: A kernelization algorithm for \(d\)-hitting set / 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 Subexponential Parameterized Algorithm for Proper Interval Completion
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithm for Interval Completion
+Normal rank
@@ Property / cites work @@
+Unit interval editing is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Linear Recognition of Almost Interval Graphs
@@ Property / cites work: Linear Recognition of Almost Interval Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Interval Deletion Is Fixed-Parameter Tractable
@@ Property / cites work: Interval Deletion Is Fixed-Parameter Tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal editing is fixed-parameter tractable
@@ Property / cites work: Chordal editing is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Skew-adjacency matrices of graphs
@@ Property / cites work: Skew-adjacency matrices of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Editing the Simplest Graphs
@@ Property / cites work: Editing the Simplest Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the threshold of intractability
@@ Property / cites work: On the threshold of intractability / 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 @@
+Q5510744
@@ Property / cites work: Q5510744 / 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 @@
+Subexponential Parameterized Algorithm for Minimum Fill-In
+Normal rank
@@ Property / cites work @@
+A unified approximation algorithm for node-deletion problems
+Normal rank
@@ Property / cites work @@
+Faster parameterized algorithms for deletion to split graphs
+Normal rank
@@ Property / cites work @@
+Q5614003
@@ Property / cites work: Q5614003 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Combinatorics
@@ Property / cites work: Extremal Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The rank and size of graphs
@@ Property / cites work: The rank and size of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+On the complexity of matrix rank and rigidity
@@ Property / cites work: On the complexity of matrix rank and rigidity / rank @@
+Normal rank
@@ Property / cites work @@
+Finding small separators in linear time via treewidth reduction
+Normal rank
@@ Property / cites work @@
+Reducing rank of the adjacency matrix by graph modification
+Normal rank
@@ Property / cites work @@
+The maximum edge biclique problem is NP-complete
@@ Property / cites work: The maximum edge biclique problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Bicyclic oriented graphs with skew-rank 2 or 4
@@ Property / cites work: Bicyclic oriented graphs with skew-rank 2 or 4 / 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