| Publication | Date of Publication | Type |
|---|
| Counting distinct square substrings in sublinear time | 2026-08-05 | Paper |
| Shortest undirected paths in de Bruijn graphs | 2026-07-17 | Paper |
| Faster approximate elastic-degenerate string matching. Part A | 2026-07-17 | Paper |
| Enhancing generalized compressed suffix trees, with applications | 2026-06-08 | Paper |
| Approximate suffix-prefix dictionary queries | 2026-05-12 | Paper |
Quasi-linear-time algorithm for a longest common circular factor
Theoretical Computer Science | 2026-05-11 | Paper |
Computing string covers in sublinear time
Theory of Computing Systems | 2026-04-27 | Paper |
| Minimizers in semi-dynamic strings | 2026-02-26 | Paper |
Internal quasiperiod queries
Theoretical Computer Science | 2026-02-12 | Paper |
| Approximate circular pattern matching under edit distance | 2025-11-10 | Paper |
Finding the cyclic covers of a string
Information Processing Letters | 2025-10-23 | Paper |
| Approximate circular pattern matching | 2025-06-19 | Paper |
Elastic-degenerate string comparison
Information and Computation | 2025-05-19 | Paper |
Subsequence covers of words
Theoretical Computer Science | 2025-05-04 | Paper |
Elastic-degenerate string matching with 1 error or mismatch
Theory of Computing Systems | 2024-11-12 | Paper |
| Comparing elastic-degenerate strings: algorithms, lower bounds, and applications | 2024-10-21 | Paper |
| Linear-time computation of cyclic roots and cyclic covers of a string | 2024-10-21 | Paper |
| Suffix-prefix queries on a dictionary | 2024-10-21 | Paper |
| Linear-time computation of shortest covers of all rotations of a string | 2024-05-06 | Paper |
| Rectangular tile covers of 2D-strings | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
Finding the cyclic covers of a string
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
scientific article; zbMATH DE number 7740932 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
Subsequence covers of words
String Processing and Information Retrieval | 2023-08-04 | Paper |
Faster recovery of approximate periods over edit distance
String Processing and Information Retrieval | 2023-07-28 | Paper |
Elastic-degenerate string matching with 1 error
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| scientific article; zbMATH DE number 7695998 (Why is no real title available?) | 2023-06-14 | Paper |
Counting distinct patterns in internal dictionary matching
(available as arXiv preprint) | 2023-02-07 | Paper |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods | 2023-02-07 | Paper |
The number of repetitions in 2D-strings
(available as arXiv preprint) | 2023-02-07 | Paper |
Internal Quasiperiod Queries
1511.681 | 2022-12-22 | Paper |
Efficient Enumeration of Distinct Factors Using Package Representations
1511.68098 | 2022-12-22 | Paper |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
(available as arXiv preprint) | 2022-07-18 | Paper |
| String covers of a tree | 2022-06-15 | Paper |
Efficient representation and counting of antipower factors in words
Information and Computation | 2022-06-13 | Paper |
Syntactic view of sigma-tau generation of permutations
Theoretical Computer Science | 2021-08-11 | Paper |
Shortest covers of all cyclic shifts of a string
Theoretical Computer Science | 2021-04-14 | Paper |
Circular pattern matching with \(k\) mismatches
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Shortest covers of all cyclic shifts of a string
WALCOM: Algorithms and Computation | 2020-07-22 | Paper |
Circular pattern matching with k mismatches
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Syntactic view of sigma-tau generation of permutations
Language and Automata Theory and Applications | 2019-12-04 | Paper |
Efficient representation and counting of antipower factors in words
Lecture Notes in Computer Science | 2019-12-04 | Paper |
