| No. |
Title |
Author |
Year |
|---|
| 1 |
Approximation Algorithms for the Longest Run Subsequence Problem |
Asahiro, Yuichi et al. |
2023 |
| 2 |
Approximation Algorithms for Covering Vertices by Long Paths |
Gong, Mingyang et al. |
2022 |
| 3 |
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants |
Asahiro, Yuichi et al. |
2022 |
| 4 |
A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem |
Xu, Yao et al. |
2017 |
| 5 |
Single Machine Scheduling with Job-Dependent Machine Deterioration |
Luo, Wenchang et al. |
2016 |
