Tadatoshi Utashima
From MaRDI portal
Person:2154119
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants Discrete Applied Mathematics | 2024-05-29 | Paper |
| Polynomial-time equivalences and refined algorithms for longest common subsequence variants | 2024-05-06 | Paper |
| Path cover problems with length cost Algorithmica | 2023-11-17 | Paper |
| Path cover problems with length cost | 2022-07-13 | Paper |
| Exact algorithms for the repetition-bounded longest common subsequence problem Theoretical Computer Science | 2020-09-01 | Paper |
| Exact algorithms for the bounded repetition longest common subsequence problem | 2020-05-13 | Paper |
Research outcomes over time
This page was built for person: Tadatoshi Utashima
