| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Approximation Algorithms for the Longest Run Subsequence Problem | Asahiro, Yuichi et al. | 2023 |
| 2 | Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants | Asahiro, Yuichi et al. | 2022 |
| 3 | Space-Efficient Algorithms for Longest Increasing Subsequence | Kiyomi, Masashi et al. | 2018 |
| 4 | A Faster Parameterized Algorithm for Pseudoforest Deletion | Bodlaender, Hans L. et al. | 2017 |
| 5 | On Directed Covering and Domination Problems | Hanaka, Tesshu et al. | 2017 |
| 6 | Settlement Fund Circulation Problem | Hayakawa, Hitoshi et al. | 2017 |
| 7 | Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity | Bodlaender, Hans L. et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 7 |