| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Independent Set Reconfiguration on Directed Graphs | Ito, Takehiro et al. | 2022 |
| 2 | Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint | Bousquet, Nicolas et al. | 2022 |
| 3 | Finding the Anticover of a String | Alzamel, Mai et al. | 2020 |
| 4 | Reconfiguration of Spanning Trees with Many or Few Leaves | Bousquet, Nicolas et al. | 2020 |
| 5 | Shortest Reconfiguration of Colorings Under Kempe Changes | Bonamy, Marthe et al. | 2020 |
| 6 | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs | Conte, Alessio et al. | 2019 |
| 7 | The Perfect Matching Reconfiguration Problem | Bonamy, Marthe et al. | 2019 |
| 8 | Efficient Enumeration of Dominating Sets for Sparse Graphs | Kurita, Kazuhiro et al. | 2018 |
| 9 | On Maximal Cliques with Connectivity Constraints in Directed Graphs | Conte, Alessio et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |