Algorithmic meta-theorems for combinatorial reconfiguration revisited
From MaRDI portal
Cites work
- A faster parameterized algorithm for treedepth
- A strongly polynomial minimum cost circulation algorithm
- Algorithmic meta-theorems for restrictions of treewidth
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Complexity of independent set reconfigurability problems
- Easy problems for tree-decomposable graphs
- Fundamentals of parameterized complexity
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- scientific article; zbMATH DE number 7788607 (Why is no real title available?)
- scientific article; zbMATH DE number 7803587 (Why is no real title available?)
- Improved upper bounds for vertex cover
- Independent set reconfiguration parameterized by modular-width
- Introduction to reconfiguration
- Linear time solvable optimization problems on graphs of bounded clique-width
- Model checking lower bounds for simple graphs
- Modular decomposition and transitive orientation
- On the complexity of reconfiguration problems
- On the parameterized complexity of reconfiguration of connected dominating sets
- On the parameterized complexity of reconfiguration problems
- Parameterized algorithms
- Parameterized problems complete for nondeterministic FPT time and logarithmic space
- Parametrized complexity theory.
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguration of dominating sets
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect
- Reconfiguration on sparse graphs
- Reconfiguration over tree decompositions
- Reconfiguring undirected paths
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
- The complexity of change
- The complexity of independent set reconfiguration on bipartite graphs
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Token sliding on split graphs
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 Q6969621)
