Finding Distinct Subpalindromes Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (Stringology, 2013)

$ mathrm{Pal}^k$ Is Linear Recognizable Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (CoRR, 2014)

Pal k is Linear Recognizable Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (SOFSEM, 2015)

The Number of Distinct Subpalindromes in Random Words. - Mikhail Rubinchik; Arseny M. Shur (Fundam. Informaticae, 2016)

Palindromic Length in Linear Time. - Kirill Borozdin; Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (CPM, 2017)

Counting Palindromes in Substrings. - Mikhail Rubinchik; Arseny M. Shur (SPIRE, 2017)

EERTREE: An efficient data structure for processing palindromes in strings. - Mikhail Rubinchik; Arseny M. Shur (Eur. J. Comb., 2018)

Palindromic k-Factorization in Pure Linear Time. - Mikhail Rubinchik; Arseny M. Shur (MFCS, 2020)

Distance Labeling for Families of Cycles. - Arseny M. Shur; Mikhail Rubinchik (SOFSEM, 2024)