Hello everyone,during the Mittagsseminar on 29.05.2018 I will present the eertree and some applications and extensions of it.
An eertree is a relatively simple tree-like data structure with a nice construction. It allows solving several problems regarding palindromes in strings with a good runtime and little space (i.e. mostly linear in the input).
The eertree was introduced by Mikhail Rubinchik and Arseny M. Shur in 2015. You can find a pre-print under arXiv:1506.04862 .
Sorry for the late email, I just learned about this mailing list. Have a nice evening, Alexander