Pages that link to "Item:Q527426"

The following pages link to On the parameterized complexity of reconfiguration problems (Q527426):

Displaying 38 items.

• Finding shortest paths between graph colourings (Q309791) (← links)
• Reconfiguration of dominating sets (Q346508) (← links)
• Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
• The complexity of dominating set reconfiguration (Q517018) (← links)
• Incremental problems in the parameterized complexity setting (Q519883) (← links)
• On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
• Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
• Reconfiguration on sparse graphs (Q1747496) (← links)
• Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
• Dominating sets reconfiguration under token sliding (Q2032965) (← links)
• Token sliding on split graphs (Q2048202) (← links)
• Reconfiguration graphs for dominating sets (Q2073197) (← links)
• On reconfigurability of target sets (Q2110378) (← links)
• Multistage vertex cover (Q2135630) (← links)
• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
• Parameterized complexity of independent set reconfiguration problems (Q2192091) (← links)
• Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
• Introduction to reconfiguration (Q2331456) (← links)
• Rerouting shortest paths in planar graphs (Q2403796) (← links)
• Computing the flip distance between triangulations (Q2408209) (← links)
• Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
• Reconfiguration of cliques in a graph (Q2700609) (← links)
• Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
• Independent Set Reconfiguration in Cographs and their Generalizations (Q2825488) (← links)
• (Q2867090) (redirect page) (← links)
• Vertex Cover Reconfiguration and Beyond (Q2942651) (← links)
• Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
• Reconfiguration of Vertex Covers in a Graph (Q2946052) (← links)
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
• The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
• (Q5090459) (← links)
• Reconfiguration of Colorable Sets in Classes of Perfect Graphs (Q5116491) (← links)
• Complexity of Coloring Reconfiguration under Recolorability Constraints (Q5136283) (← links)
• Kernelization of Whitney Switches (Q5874518) (← links)
• Reconfiguring spanning and induced subgraphs (Q5916255) (← links)
• Linear transformations between dominating sets in the TAR-model (Q6087209) (← links)
• (Q6089671) (← links)