On solution discovery via reconfiguration
From MaRDI portal
Cites work
- A strongly polynomial minimum cost circulation algorithm
- A survey of local search methods for graph coloring
- Analytical approach to parallel repetition
- Approximation algorithms for polynomial-expansion and low-density graphs
- Complexity of independent set reconfigurability problems
- Complexity of token swapping and its variants
- Covering small independent sets and separators with applications to parameterized algorithms
- Deciding first-order properties of nowhere dense graphs
- Deterministic fully dynamic data structures for vertex cover and matching
- Dominating sets reconfiguration under token sliding
- Domination problems in nowhere-dense classes of graphs
- Dynamic parameterized problems
- Finding paths between 3-colorings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Finding shortest paths between graph colourings
- First-Order Model Checking on Structurally Sparse Graph Classes
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Fixing improper colorings of graphs
- FPT algorithms for domination in sparse graphs and beyond
- Fully dynamic maximal independent set with sublinear update time
- Graph minors. V. Excluding a planar graph
- Hard coloring problems in low degree planar bipartite graphs
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 5139463 (Why is no real title available?)
- scientific article; zbMATH DE number 3495588 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- scientific article; zbMATH DE number 6850309 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Hyperbolicity, degeneracy, and expansion of random intersection graphs
- Incremental list coloring of graphs, parameterized by conservation
- Introduction to reconfiguration
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maintaining a large matching and a small vertex cover
- Mixing 3-colourings in bipartite graphs
- Models and solution techniques for frequency assignment problems
- On the complexity of reconfiguration problems
- On the complexity of restoring corrupted colorings
- On the complexity of some colorful problems parameterized by treewidth
- On the parameterized complexity of dynamic problems
- On the parameterized complexity of reconfiguration problems
- On the ratio of optimal integral and fractional covers
- Parameterized algorithms
- Parameterized complexity of independent set in H-free graphs
- Parametrized complexity theory.
- Planar Formulae and Their Uses
- Polynomial kernels and wideness properties of nowhere dense graph classes
- Polynomial-time algorithm for sliding tokens on trees
- Progressive algorithms for domination and independence
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfigurations in Graphs and Grids
- Reducibility among combinatorial problems
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- The complexity of change
- The complexity of dominating set reconfiguration
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- TS-reconfiguration of dominating sets in circle and circular-arc graphs
This page was built for publication: On solution discovery via reconfiguration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859741)
