11 citations · 22 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Distance Labeling for Families of Cycles
Arseny M. Shur, Mikhail Rubinchik
For an arbitrary finite family of graphs, the distance labeling problem asks to assign labels to all nodes of every graph in the family in a way that allows one to recover the dist…
math.CO2015★ 9 cited
The Number of Distinct Subpalindromes in Random Words
Mikhail Rubinchik, Arseny M. Shur
We prove that a random word of length over a -ary fixed alphabet contains, on expectation, distinct palindromic factors. We study this number of factors, $E(n,…