Funder
Ministry of Education, Science and Technological Development of Serbia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference23 articles.
1. M. Adamczyk, M. Alzamel, P. Charalampopoulos, C.S. Iliopoulos, J. Radoszewski, Palindromic decompositions with gaps and errors, in: Computer Science – Theory and Applications, 12th International Computer Science Symposium in Russia (CSR 2017), Kazan, Russia, 2017, pp. 48–61.
2. A. Alatabbi, C.S. Iliopoulos, M.S. Rahman, Maximal palindromic factorization, in: Proceedings of the Prague Stringology Conference 2013 (PSC 2013), Prague, Czech Republic, 2013, pp. 70–77.
3. Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings;Amir;Theoret. Comput. Sci.,2016
4. Diverse palindromic factorization is NP-complete;Bannai;Internat. J. Found. Comput. Sci.,2018
5. Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words;Bašić;Discrete Appl. Math.,2012
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献