No. | Title | Author | Year |
---|---|---|---|
1 | Optimal LZ-End Parsing Is Hard | Bannai, Hideo et al. | 2023 |
2 | Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids | Kobayashi, Yasuaki et al. | 2023 |
3 | Efficient Enumerations for Minimal Multicuts and Multiway Cuts | Kurita, Kazuhiro et al. | 2020 |
4 | Finding the Anticover of a String | Alzamel, Mai et al. | 2020 |
5 | Efficient Enumeration of Dominating Sets for Sparse Graphs | Kurita, Kazuhiro et al. | 2018 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 5 |