2 papers
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…
cs.DS2020
Palindromic k-Factorization in Pure Linear Time
Mikhail Rubinchik, Arseny M. Shur
Given a string of length over a general alphabet and an integer , the problem is to decide whether is a concatenation of nonempty palindromes. Two previously kno…