6 citations · 11 across the 2 of their papers we have counts for
2 papers
cs.DS2017★ 5 cited
Computing Abelian regularities on RLE strings
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga +2
Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is sai…
cs.FL2015★ 6 cited
Diverse Palindromic Factorization is NP-Complete
Hideo Bannai, Travis Gagie, Shunsuke Inenaga +5
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.