Pages that link to "Item:Q5363782"

The following pages link to Parameterized Complexity of Graph Constraint Logic (Q5363782):

Displaying 24 items.

• The complexity of dominating set reconfiguration (Q517018) (← links)
• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
• The complexity of Snake and undirected NCL variants (Q1623271) (← links)
• Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
• Invitation to combinatorial reconfiguration (Q2154076) (← links)
• Using contracted solution graphs for solving reconfiguration problems (Q2329308) (← links)
• Introduction to reconfiguration (Q2331456) (← links)
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
• Computational complexity of jumping block puzzles (Q2695336) (← links)
• Reconfiguration of cliques in a graph (Q2700609) (← links)
• On the Complexity of Insertion Propagation with Functional Dependency Constraints (Q2817905) (← links)
• Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
• The Complexity of (List) Edge-Coloring Reconfiguration Problem (Q2980922) (← links)
• Games, Puzzles and Treewidth (Q5042461) (← links)
• The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
• Diameter of colorings under Kempe changes (Q5918932) (← links)
• Fixed-parameter algorithms for graph constraint logic (Q6041672) (← links)
• Feedback vertex set reconfiguration in planar graphs (Q6057837) (← links)
• (Q6089660) (← links)
• On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
• Computational complexity of jumping block puzzles (Q6144017) (← links)
• On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
• Algorithmic meta-theorems for combinatorial reconfiguration revisited (Q6623591) (← links)
• On finding short reconfiguration sequences between independent sets (Q6627042) (← links)