The following publications are possibly variants of this publication:
- Covering a StringCostas S. Iliopoulos, D. W. G. Moore, Kunsoo Park. algorithmica, 16(3):288-297, 1996.
- Covering a StringCostas S. Iliopoulos, Dennis Moore, Kunsoo Park. cpm 1993: 54-62
- Quasiperiodicity and String CoveringCostas S. Iliopoulos, Laurent Mouchard. TCS, 218(1):205-216, 1999. [doi]
- String Covering: A SurveyNeerja Mhaskar, W. F. Smyth. FUIN, 190(1):17-45, 2022. [doi]
- String covering with optimal coversNeerja Mhaskar, William F. Smyth. jda, 51:26-38, 2018. [doi]
- Conservative String Covering of Indeterminate StringsPavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau. stringology 2008: 108-115 [doi]
- Covering a Circular String with Substrings of Fixed LengthArt M. Duval, William F. Smyth. ijfcs, 7(1):87-93, 1996.
- Two-Dimensional Prefix String Matching and Covering on Square MatricesMaxime Crochemore, Costas S. Iliopoulos, Maureen Korda. algorithmica, 20(4):353-373, 1998.
- The Subtree Max Gap Problem with Application to Parallel String CoveringOmer Berkman, Costas S. Iliopoulos, Kunsoo Park. iandc, 123(1):127-137, 1995.
- The Subtree Max Gap Problem with Application to Parallel String CoveringAmir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park. soda 1994: 501-510