| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Sorting Balls and Water: Equivalence and Computational Complexity | Ito, Takehiro et al. | 2022 |
| 2 | Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs | Conte, Alessio et al. | 2019 |
| 3 | Efficient Enumeration of Dominating Sets for Sparse Graphs | Kurita, Kazuhiro et al. | 2018 |
| 4 | On Maximal Cliques with Connectivity Constraints in Directed Graphs | Conte, Alessio et al. | 2017 |
| 5 | Approximation and Hardness of Token Swapping | Miltzow, Tillmann et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |