2 papers
cs.DS2026
Fully Persistent Dynamic LCE via AVL Trees and AVL Grammars
Taiki Kaneda, Hiroki Arimura, Shunsuke Inenaga
We study fully persistent dynamic strings with equality and longest common extension (LCE) queries. Straightforward full persistence is problematic for the splay-based FeST structu…
cs.DS2026
Fast and Practical Single-Exponential Algorithms for Branchwidth
Taiki Kaneda, Yasuaki Kobayashi, Hisao Tamaki
In this paper, we present exact exponential algorithms for computing branchwidth that are fast both in theory and in practice. The running times of these algorithms are single-expo…