Computing Longest Lyndon Subsequences
Channel: Dominik Koeppl
Date: 18/05/2022

Presentation of the paper "Computing Longest (Common) Lyndon Subsequences" nominated with the *best paper award* at the 33rd International Workshop on Combinatorial Algorithms (IWOCA).

☆ paper: https://doi.org/10.1007/978-3-031-06678-8_10
☆ mirror of this video: https://dkppl.de/redir.php?t=paper&f=iwoca22lyndon.mp4
☆ slides: https://dkppl.de/redir.php?t=paper&f=iwoca22lyndon.s.pdf
☆ preprint: https://dkppl.de/redir.php?t=paper&f=iwoca22lyndon.m.pdf

You can find other material related to my research at my homepage https://dkppl.de/.

As always, questions and comments are welcome!