1. Alamro, H., Badkobeh, G., Belazzougui, D., Iliopoulos, C.S., Puglisi, S.J.: Computing the antiperiod(s) of a string. In: Pisanti, N., Pissis, S.P. (eds.) Proceedings of 30th Combinatorial Pattern Matching, (CPM), LIPIcs, vol. 128, pp. 32:1–32:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
2. Alzamel, A., et al.: Finding the anticover of a string. In: Proceedings of 31st Combinatorial Pattern Matching (CPM), LIPIcs (2020, to appear)
3. Amir, A., Levy, A., Lewenstein, M., Lubin, R., Porat, B.: Can we recover the cover? In: Proceedings of 28st Annual Symposium on Combinatorial Pattern Matching (CPM), LIPICS (2017)
4. Antoniou, P., Crochemore, M., Iliopoulos, C.S., Jayasekera, I., Landau, G.M.: Conservative string covering of indeterminate strings. In: Proceedings of Prague Stringology Conference, pp. 108–115 (2008)
5. Lecture Notes in Computer Science;A Apostolico,1997