| No. |
Title |
Author |
Year |
| 1 |
Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited |
Gima, Tatsuya et al. |
2022 |
| 2 |
Independent Set Reconfiguration on Directed Graphs |
Ito, Takehiro et al. |
2022 |
| 3 |
Invitation to Combinatorial Reconfiguration (Invited Talk) |
Ito, Takehiro |
2022 |
| 4 |
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint |
Bousquet, Nicolas et al. |
2022 |
| 5 |
Sorting Balls and Water: Equivalence and Computational Complexity |
Ito, Takehiro et al. |
2022 |
| 6 |
Fixed-Parameter Algorithms for Graph Constraint Logic |
Hatanaka, Tatsuhiko et al. |
2020 |
| 7 |
Minimization and Parameterized Variants of Vertex Partition Problems on Graphs |
Tamura, Yuma et al. |
2020 |
| 8 |
Reconfiguration of Spanning Trees with Many or Few Leaves |
Bousquet, Nicolas et al. |
2020 |
| 9 |
Shortest Reconfiguration of Colorings Under Kempe Changes |
Bonamy, Marthe et al. |
2020 |
| 10 |
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges |
Mizuta, Haruka et al. |
2019 |
| 11 |
Shortest Reconfiguration of Perfect Matchings via Alternating Cycles |
Ito, Takehiro et al. |
2019 |
| 12 |
The Perfect Matching Reconfiguration Problem |
Bonamy, Marthe et al. |
2019 |
| 13 |
Algorithms for Coloring Reconfiguration Under Recolorability Constraints |
Osawa, Hiroki et al. |
2018 |
| 14 |
Reconfiguration of Colorable Sets in Classes of Perfect Graphs |
Ito, Takehiro et al. |
2018 |
| 15 |
Complexity of Coloring Reconfiguration under Recolorability Constraints |
Osawa, Hiroki et al. |
2017 |
| 16 |
Complexity of the Multi-Service Center Problem |
Ito, Takehiro et al. |
2017 |
| 17 |
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters |
Hatanaka, Tatsuhiko et al. |
2017 |
