Computing the Minimum k-Cover of a String

Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang. Computing the Minimum k-Cover of a String. In Milan Simánek, editor, Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, September 22-24, 2003. pages 51-64, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, 2003. [doi]

@inproceedings{ColeIMSY03,
  title = {Computing the Minimum k-Cover of a String},
  author = {Richard Cole and Costas S. Iliopoulos and Manal Mohamed and William F. Smyth and Lu Yang},
  year = {2003},
  url = {http://www.stringology.org/event/2003/p5.html},
  researchr = {https://researchr.org/publication/ColeIMSY03},
  cites = {0},
  citedby = {0},
  pages = {51-64},
  booktitle = {Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, September 22-24, 2003},
  editor = {Milan Simánek},
  publisher = {Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University},
  isbn = {80-01-02823-2},
}