1. LNCS;P Alimonti,1997
2. Bannai, H., Funakoshi, M., Hendrian, D., Matsuda, M., Puglisi, S.J.: Height-bounded Lempel-Ziv encodings. arXiv preprint arXiv:2403.08209 (2024)
3. Bannai, H., Funakoshi, M., Kurita, K., Nakashima, Y., Seto, K., Uno, T.: Optimal LZ-end parsing is hard. In: Bulteau, L., Lipták, Z. (eds.) 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 259, pp. 3:1–3:11 (2023)
4. Cenzato, D., Lipták, Zs.: A theoretical and experimental analysis of BWT variants for string collections. In: Bannai, H., Holub, J. (eds.) 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, 27–29 June 2022, Prague, Czech Republic. LIPIcs, vol. 223, pp. 25:1–25:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022). https://doi.org/10.4230/LIPICS.CPM.2022.25
5. Chlebík, M., Chlebíková, J.: Complexity of approximating bounded variants of optimization problems. Theoret. Comput. Sci. 354(3), 320–338 (2006)