No. | Title | Author | Year |
---|---|---|---|
1 | Algorithms for Coloring Reconfiguration Under Recolorability Digraphs | Fujii, Soichiro et al. | 2022 |
2 | Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint | Bousquet, Nicolas et al. | 2022 |
3 | Sorting Balls and Water: Equivalence and Computational Complexity | Ito, Takehiro et al. | 2022 |
4 | Fixed-Parameter Algorithms for Graph Constraint Logic | Hatanaka, Tatsuhiko et al. | 2020 |
5 | Reconfiguration of Spanning Trees with Many or Few Leaves | Bousquet, Nicolas et al. | 2020 |
6 | Shortest Reconfiguration of Colorings Under Kempe Changes | Bonamy, Marthe et al. | 2020 |
7 | Algorithms for Coloring Reconfiguration Under Recolorability Constraints | Osawa, Hiroki et al. | 2018 |
8 | Complexity of Coloring Reconfiguration under Recolorability Constraints | Osawa, Hiroki et al. | 2017 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 8 |