| Publication | Date of Publication | Type |
|---|
| Optimal LZ-end parsing is hard | 2024-10-21 | Paper |
| Faster space-efficient STR-IC-LCS computation | 2024-06-04 | Paper |
| Optimally computing compressed indexing arrays based on the compact directed acyclic word graph | 2024-05-29 | Paper |
| Largest repetition factorization of Fibonacci words | 2024-05-29 | Paper |
| Linear-time computation of generalized minimal absent words for multiple strings | 2024-05-29 | Paper |
| Minimal absent words on run-length encoded strings | 2024-05-06 | Paper |
| Compact data structures for shortest unique substring queries | 2024-04-19 | Paper |
| On longest common property preserved substring queries | 2024-04-19 | Paper |
| Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets | 2024-04-19 | Paper |
| Space-efficient STR-IC-LCS computation | 2023-08-14 | Paper |
| Recovering, counting and enumerating strings from forward and backward suffix arrays | 2023-07-28 | Paper |
| On Sensitivity of Compact Directed Acyclic Word Graphs | 2023-07-25 | Paper |
| The parameterized suffix tray | 2023-03-22 | Paper |
| Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences | 2023-02-07 | Paper |
| DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures | 2023-02-07 | Paper |
| An improved data structure for left-right maximal generic words problem | 2023-02-03 | Paper |
| On Repetitiveness Measures of Thue-Morse Words | 2022-12-22 | Paper |
| Lyndon Words, the Three Squares Lemma, and Primitive Squares | 2022-12-22 | Paper |
| Towards Efficient Interactive Computation of Dynamic Time Warping Distance | 2022-12-22 | Paper |
| Parameterized DAWGs: efficient constructions and bidirectional pattern searches | 2022-09-27 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2022-08-10 | Paper |
| Computing runs on a trie | 2022-07-18 | Paper |
| Faster queries for longest substring palindrome after block edit | 2022-07-18 | Paper |
| On the size of overlapping Lempel-Ziv and Lyndon factorizations | 2022-07-18 | Paper |
| On the approximation ratio of LZ-end to LZ77 | 2022-06-15 | Paper |
| Longest common rollercoasters | 2022-06-15 | Paper |
| Grammar index by induced suffix sorting | 2022-06-15 | Paper |
| Position heaps for Cartesian-tree matching on strings and tries | 2022-06-15 | Paper |
| c-trie++: a dynamic trie tailored for fast prefix searches | 2022-06-08 | Paper |
| Factorizing strings into repetitions | 2022-05-09 | Paper |
| Computing minimal unique substrings for a sliding window | 2022-03-22 | Paper |
| Palindromic trees for a sliding window and its applications | 2021-10-19 | Paper |
| Efficiently computing runs on a trie | 2021-09-27 | Paper |
| Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings | 2021-06-11 | Paper |
| Counting Lyndon Subsequences | 2021-06-02 | Paper |
| Combinatorics of minimal absent words for a sliding window | 2021-05-18 | Paper |
| Computing longest palindromic substring after single-character or block-wise edits | 2021-02-15 | Paper |
| Faster Online Elastic Degenerate String Matching | 2020-12-16 | Paper |
| Longest substring palindrome after edit | 2020-12-16 | Paper |
| Longest Lyndon Substring After Edit | 2020-12-16 | Paper |
| Lyndon factorization of grammar compressed texts revisited | 2020-12-16 | Paper |
| Almost linear time computation of maximal repetitions in run length encoded strings | 2020-11-25 | Paper |
| Space-efficient algorithms for computing minimal/shortest unique substrings | 2020-10-22 | Paper |
| Faster STR-EC-LCS Computation | 2020-07-20 | Paper |
| Minimal Unique Substrings and Minimal Absent Words in a Sliding Window | 2020-07-20 | Paper |
| Shortest unique palindromic substring queries on run-length encoded strings | 2020-02-25 | Paper |
| The parameterized position heap of a trie | 2020-02-06 | Paper |
| On the size of the smallest alphabet for Lyndon trees | 2019-10-07 | Paper |
| Algorithms and combinatorial properties on shortest unique palindromic substrings | 2019-01-18 | Paper |
| Longest common abelian factors and large alphabets | 2018-10-17 | Paper |
| Shortest unique palindromic substring queries in optimal time | 2018-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636645 | 2018-04-19 | Paper |
| A new characterization of maximal repetitions by Lyndon trees | 2017-10-05 | Paper |
| The “Runs” Theorem | 2017-09-25 | Paper |
| Inferring strings from Lyndon factorization | 2017-09-07 | Paper |
| Faster Lyndon factorization algorithms for SLP and LZ78 compressed text | 2017-02-06 | Paper |
| Constructing LZ78 tries and position heaps in linear time for large alphabets | 2015-06-02 | Paper |
| Inferring Strings from Lyndon Factorization | 2014-10-14 | Paper |
| Efficient Lyndon Factorization of Grammar Compressed Text | 2013-06-14 | Paper |
