On the parameterized complexity of reconfiguration problems (Q527426): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+On the Parameterized Complexity of Reconfiguration Problems
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6237075
@@ Property / title @@
+On the Parameterized Complexity of Reconfiguration Problems (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68155
@@ Property / zbMATH Open document ID: 1350.68155 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-03898-8_24
@@ Property / DOI: 10.1007/978-3-319-03898-8_24 / rank @@
+Normal rank
@@ Property / published in @@
+Parameterized and Exact Computation
@@ Property / published in: Parameterized and Exact Computation / rank @@
+Normal rank
@@ Property / publication date @@
+December 2013Timestamp +2013-12-10T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-12-10T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 10 December 2013 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6237075
@@ Property / zbMATH DE Number: 6237075 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2481000617
@@ Property / OpenAlex ID: W2481000617 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4500916
@@ Property / cites work: Q4500916 / rank @@
+Normal rank
@@ Property / cites work @@
+A Cubic Kernel for Feedback Vertex Set
@@ Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Rerouting Shortest Paths
@@ Property / cites work: The Complexity of Rerouting Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration
+Normal rank
@@ Property / cites work @@
+Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
+Normal rank
@@ Property / cites work @@
+Mixing 3-colourings in bipartite graphs
@@ Property / cites work: Mixing 3-colourings in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths between 3-colorings
@@ Property / cites work: Finding paths between 3-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The union of minimal hitting sets: parameterized combinatorial bounds and counting
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+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 @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
+Normal rank
@@ Property / cites work @@
+The \(k\)-dominating graph
@@ Property / cites work: The \(k\)-dominating graph / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Dominating Set Reconfiguration
@@ Property / cites work: The Complexity of Dominating Set Reconfiguration / rank @@
+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 \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+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 @@
+Reconfiguration of list edge-colorings in a graph
@@ Property / cites work: Reconfiguration of list edge-colorings in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability of Token Jumping on Planar Graphs
+Normal rank
@@ Property / cites work @@
+On the Parameterized Complexity for Token Jumping on Graphs
+Normal rank
@@ Property / cites work @@
+Finding Shortest Paths Between Graph Colourings
@@ Property / cites work: Finding Shortest Paths Between Graph Colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths between shortest paths
@@ Property / cites work: Shortest paths between shortest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs
+Normal rank
@@ Property / cites work @@
+The node-deletion problem for hereditary properties is NP-complete
+Normal rank
@@ Property / cites work @@
+Reconfiguration on sparse graphs
@@ Property / cites work: Reconfiguration on sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving min ones 2-SAT as fast as vertex cover
@@ Property / cites work: Solving min ones 2-SAT as fast as vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
+Normal rank
@@ Property / cites work @@
+Vertex Cover Reconfiguration and Beyond
@@ Property / cites work: Vertex Cover Reconfiguration and Beyond / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration over Tree Decompositions
@@ Property / cites work: Reconfiguration over Tree Decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for feedback set problems and their duals in tournaments
+Normal rank
@@ Property / cites work @@
+Reconfiguration of dominating sets
@@ Property / cites work: Reconfiguration of dominating sets / rank @@
+Normal rank
@@ Property / cites work @@
+A 4             <i>k</i>             <sup>2</sup>             kernel for feedback vertex set
+Normal rank
@@ Property / cites work @@
+The complexity of change
@@ Property / cites work: The complexity of change / rank @@
+Normal rank

Latest revision as of 18:40, 13 July 2024

scientific article; zbMATH DE number 6237075

On the Parameterized Complexity of Reconfiguration Problems

Language	Label	Description	Also known as
English	On the parameterized complexity of reconfiguration problems	scientific article; zbMATH DE number 6237075	On the Parameterized Complexity of Reconfiguration Problems