Algorithmic meta-theorems for combinatorial reconfiguration revisited

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Reconfiguration of dominating sets
Fundamentals of parameterized complexity
Complexity of independent set reconfigurability problems
On the parameterized complexity of reconfiguration problems
On the complexity of reconfiguration problems
Improved upper bounds for vertex cover
On the parameterized complexity of reconfiguration of connected dominating sets
Fixed-parameter algorithms for cluster vertex deletion
A strongly polynomial minimum cost circulation algorithm
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
Modular decomposition and transitive orientation
Reconfiguration in bounded bandwidth and tree-depth
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
Reconfiguration on sparse graphs
Algorithmic meta-theorems for restrictions of treewidth
Linear time solvable optimization problems on graphs of bounded clique-width
Token sliding on split graphs
Parameterized complexity of fair deletion problems
Reconfiguring undirected paths
Introduction to reconfiguration
Parametrized complexity theory.
PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
The complexity of change
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
Reconfiguration over Tree Decompositions
Easy problems for tree-decomposable graphs
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
The Complexity of Independent Set Reconfiguration on Bipartite Graphs
A Faster Parameterized Algorithm for Treedepth
Parameterized Complexity of Graph Constraint Logic
Model Checking Lower Bounds for Simple Graphs
Parameterized Algorithms
Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
Independent set reconfiguration parameterized by modular-width
Galactic token sliding

This page was built for publication: Algorithmic meta-theorems for combinatorial reconfiguration revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623591)