| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Reconfiguration of Minimum Steiner Trees via Vertex Exchanges | Mizuta, Haruka et al. | 2019 |
| 2 | Shortest Reconfiguration of Perfect Matchings via Alternating Cycles | Ito, Takehiro et al. | 2019 |
| 3 | The Perfect Matching Reconfiguration Problem | Bonamy, Marthe et al. | 2019 |
| 4 | Algorithms for Coloring Reconfiguration Under Recolorability Constraints | Osawa, Hiroki et al. | 2018 |
| 5 | Reconfiguration of Colorable Sets in Classes of Perfect Graphs | Ito, Takehiro et al. | 2018 |
| 6 | Complexity of Coloring Reconfiguration under Recolorability Constraints | Osawa, Hiroki et al. | 2017 |
| 7 | Complexity of the Multi-Service Center Problem | Ito, Takehiro et al. | 2017 |
| 8 | Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters | Hatanaka, Tatsuhiko et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |