Author:
Crochemore Maxime,Iliopoulos Costas S.,Kociumaka Tomasz,Kubica Marcin,Radoszewski Jakub,Rytter Wojciech,Tyczyński Wojciech,Waleń Tomasz
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Alon, N., Grytczuk, J.: Breaking the rhythm on graphs. Discrete Mathematics 308(8), 1375–1380 (2008)
2. Alon, N., Grytczuk, J., Haluszczak, M., Riordan, O.: Nonrepetitive colorings of graphs. Random Struct. Algorithms 21(3-4), 336–346 (2002)
3. Blanchet-Sadri, F., Mercas, R., Scott, G.: Counting distinct squares in partial words. Acta Cybern. 19(2), 465–477 (2009)
4. Bresar, B., Grytczuk, J., Klavzar, S., Niwczyk, S., Peterin, I.: Nonrepetitive colorings of trees. Discrete Mathematics 307(2), 163–172 (2007)
5. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tight Bound for the Number of Distinct Palindromes in a Tree;The Electronic Journal of Combinatorics;2023-04-21
2. String Covers of a Tree Revisited;String Processing and Information Retrieval;2023
3. Efficiently computing runs on a trie;Theoretical Computer Science;2021-10
4. Experimental evaluation of algorithms for computing quasiperiods;Theoretical Computer Science;2021-01
5. String Covers of a Tree;String Processing and Information Retrieval;2021