| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Feasibility of Flow Decomposition with Subpath Constraints in Linear Time | Gibney, Daniel et al. | 2022 |
| 2 | Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard | Gibney, Daniel et al. | 2021 |
| 3 | FM-Index Reveals the Reverse Suffix Array | Ganguly, Arnab et al. | 2020 |
| 4 | On the Complexity of BWT-Runs Minimization via Alphabet Reordering | Bentley, Jason W. et al. | 2020 |
| 5 | The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance | Hoppenworth, Gary et al. | 2020 |
| 6 | On the Hardness and Inapproximability of Recognizing Wheeler Graphs | Gibney, Daniel et al. | 2019 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |