Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes

Charalampopoulos, Panagiotis; Crochemore, Maxime; Iliopoulos, Costas S.; Kociumaka, Tomasz; Pissis, Solon P.; Radoszewski, Jakub; Rytter, Wojciech; Walen, Tomasz

doi:10.1007/978-3-319-62389-4_9

by Charalampopoulos, Panagiotis, Crochemore, Maxime, Iliopoulos, Costas S., Kociumaka, Tomasz, Pissis, Solon P., Radoszewski, Jakub, Rytter, Wojciech and Walen, Tomasz

Reference:

P. Charalampopoulos, M. Crochemore, C. S. Iliopoulos, T. Kociumaka, S. P. Pissis, J. Radoszewski, W. Rytter, T. Walen, "Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes", in Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings, Y. Cao, J. Chen, Eds., Cham: Springer International Publishing, pp. 99–111.

Bibtex Entry:

@inproceedings{Charalampopoulos2017,
author="Charalampopoulos, Panagiotis and Crochemore, Maxime and Iliopoulos, Costas S. and Kociumaka, Tomasz and Pissis, Solon P. and Radoszewski, Jakub and Rytter, Wojciech and Walen, Tomasz",
editor="Cao, Yixin and Chen, Jianer",
title="Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes",
bookTitle="Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings",
year="2017",
publisher="Springer International Publishing",
address="Cham",
pages="99--111",
doi="10.1007/978-3-319-62389-4_9",
series="Lecture Notes in Computer Science",
volume="10392"
}