| Publication | Date of Publication | Type |
|---|
| Space-efficient online computation of string net occurrences | 2026-07-17 | Paper |
| Sorted consecutive occurrence queries in substrings | 2026-07-17 | Paper |
Subsequence matching and LCS under Cartesian-tree equivalence
Theory of Computing Systems | 2026-04-27 | Paper |
| Shortest cover after edit | 2025-12-02 | Paper |
| Subsequence matching and LCS with segment number constraints | 2025-11-11 | Paper |
Computing maximal palindromes in non-standard matching models
Information and Computation | 2025-05-19 | Paper |
| Computing longest common subsequence under Cartesian-tree matching model | 2025-02-28 | Paper |
| Computing minimal absent words and extended bispecial factors with CDAWG space | 2025-02-28 | Paper |
| Computing maximal palindromes in non-standard matching models | 2025-02-28 | Paper |
| Computing palindromes on a trie in linear time | 2024-09-11 | Paper |
| Linear-time computation of generalized minimal absent words for multiple strings | 2024-05-29 | Paper |
| Cartesian tree subsequence matching | 2024-05-06 | 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 |
Data structures for computing unique palindromes in static and non-static strings
Algorithmica | 2024-03-25 | Paper |
Internal longest palindrome queries in optimal time
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Finding top-k longest palindromes in substrings
Theoretical Computer Science | 2023-10-26 | Paper |
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions
String Processing and Information Retrieval | 2023-08-04 | Paper |
scientific article; zbMATH DE number 7696005 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
Lyndon Words, the Three Squares Lemma, and Primitive Squares
1522.68436 | 2022-12-22 | Paper |
Shortest unique palindromic substring queries in semi-dynamic settings
(available as arXiv preprint) | 2022-08-30 | Paper |
Combinatorics of minimal absent words for a sliding window
Theoretical Computer Science | 2022-08-10 | Paper |
Minimal unique palindromic substrings after single-character substitution
(available as arXiv preprint) | 2022-06-15 | Paper |
On the approximation ratio of LZ-end to LZ77
(available as arXiv preprint) | 2022-06-15 | Paper |
A separation of \(\gamma\) and \(b\) via Thue-Morse words
(available as arXiv preprint) | 2022-06-15 | Paper |
Computing minimal unique substrings for a sliding window
Algorithmica | 2022-03-22 | Paper |
| RePair Grammars are the Smallest Grammars for Fibonacci Words | 2022-02-16 | Paper |
Palindromic trees for a sliding window and its applications
Information Processing Letters | 2021-10-19 | Paper |
Combinatorics of minimal absent words for a sliding window
(available as arXiv preprint) | 2021-05-18 | Paper |
A Separation of \gamma and b via Thue--Morse Words
(available as arXiv preprint) | 2021-04-19 | Paper |
Space-efficient algorithms for computing minimal/shortest unique substrings
Theoretical Computer Science | 2020-10-22 | Paper |
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Tight bounds on the maximum number of shortest unique substrings
(available as arXiv preprint) | 2020-05-25 | Paper |
Algorithms and combinatorial properties on shortest unique palindromic substrings
Journal of Discrete Algorithms | 2019-01-18 | Paper |
Shortest unique palindromic substring queries in optimal time
(available as arXiv preprint) | 2018-06-15 | Paper |
| Shortest Unique Substring Queries on Run-Length Encoded Strings | 2018-03-21 | Paper |
