Vertex Cover Reconfiguration and Beyond (Q2942651): Difference between revisions

@@ Property / cites work @@
+The Complexity of Rerouting Shortest Paths
@@ Property / cites work: The Complexity of Rerouting Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Connectedness of the graph of vertex-colourings
@@ Property / cites work: Connectedness of the graph of vertex-colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Local search: is brute-force avoidable?
@@ Property / cites work: Local search: is brute-force avoidable? / rank @@
+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 @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of independent set reconfigurability problems
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of reconfiguration problems
+Normal rank
@@ Property / cites work @@
+Reconfiguration of dominating sets
@@ Property / cites work: Reconfiguration of dominating sets / rank @@
+Normal rank