| Publication | Date of Publication | Type |
|---|
Optimal Bounds for Distinct Quartics
(available as arXiv preprint) | N/A | Paper |
| Counting distinct square substrings in sublinear time | 2026-08-05 | Paper |
| Longest common extensions with wildcards: trade-off and applications | 2026-05-26 | Paper |
| Pattern matching with mismatches and wildcards | 2026-05-26 | Paper |
| An almost optimal edit distance oracle | 2026-05-12 | Paper |
| Dynamic longest common substring in polylogarithmic time | 2026-03-18 | Paper |
| Optimal bounds for distinct quartics | 2026-01-14 | Paper |
| Internal pattern matching in small space and applications | 2025-12-02 | Paper |
| Maintaining the size of LZ77 on semi-dynamic strings | 2025-12-02 | Paper |
| Approximate circular pattern matching under edit distance | 2025-11-10 | Paper |
| Faster pattern matching under edit distance: a reduction to dynamic puzzle matching and the seaweed monoid of permutation matrices | 2025-08-15 | Paper |
| Faster approximate pattern matching: a unified approach | 2025-08-12 | Paper |
| Approximate circular pattern matching | 2025-06-19 | Paper |
Subsequence covers of words
Theoretical Computer Science | 2025-05-04 | Paper |
Almost optimal exact distance oracles for planar graphs
Journal of the ACM | 2025-02-05 | Paper |
| Optimal near-linear space heaviest induced ancestors | 2024-10-21 | Paper |
Pattern masking for dictionary matching: theory and practice
Algorithmica | 2024-05-30 | Paper |
| Longest palindromic substring in sublinear time | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
Pattern masking for dictionary matching
(available as arXiv preprint) | 2024-01-15 | Paper |
Exact distance oracles for planar graphs with failing vertices
ACM Transactions on Algorithms | 2023-10-31 | Paper |
scientific article; zbMATH DE number 7740885 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
On the hardness of computing the edit distance of shallow trees
String Processing and Information Retrieval | 2023-08-04 | Paper |
Subsequence covers of words
String Processing and Information Retrieval | 2023-08-04 | Paper |
Efficient computation of sequence mappability
String Processing and Information Retrieval | 2023-07-28 | Paper |
Longest common prefixes with k-errors and applications
String Processing and Information Retrieval | 2023-07-28 | Paper |
On extended special factors of a word
String Processing and Information Retrieval | 2023-07-28 | Paper |
| scientific article; zbMATH DE number 7695992 (Why is no real title available?) | 2023-06-14 | Paper |
| scientific article; zbMATH DE number 7695998 (Why is no real title available?) | 2023-06-14 | Paper |
Property Suffix Array with Applications in Indexing Weighted Sequences
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
Counting distinct patterns in internal dictionary matching
(available as arXiv preprint) | 2023-02-07 | Paper |
| Dynamic String Alignment. | 2023-02-07 | Paper |
| Unary Words Have the Smallest Levenshtein k-Neighbourhoods | 2023-02-07 | Paper |
| Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. | 2023-02-07 | Paper |
The number of repetitions in 2D-strings
(available as arXiv preprint) | 2023-02-07 | Paper |
| Internal dictionary matching | 2023-02-03 | Paper |
Efficient Enumeration of Distinct Factors Using Package Representations
1511.68098 | 2022-12-22 | Paper |
Internal shortest absent word queries in constant time and linear space
Theoretical Computer Science | 2022-06-13 | Paper |
| Repetition Detection in a Dynamic String | 2022-05-11 | Paper |
Longest common substring made fully dynamic
(available as arXiv preprint) | 2022-05-11 | Paper |
Fault-tolerant distance labeling for planar graphs
Theoretical Computer Science | 2022-05-10 | Paper |
Efficient computation of sequence mappability
Algorithmica | 2022-05-03 | Paper |
Fault-tolerant distance labeling for planar graphs
Structural Information and Communication Complexity | 2022-03-22 | Paper |
Single-source shortest paths and strong connectivity in dynamic planar graphs
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
Internal dictionary matching
Algorithmica | 2021-06-30 | Paper |
Longest common factor after one edit operation
String Processing and Information Retrieval | 2021-02-16 | Paper |
Linear-time algorithm for long LCF with k mismatches
(available as arXiv preprint) | 2020-12-16 | Paper |
Dynamic and internal longest common substring
Algorithmica | 2020-11-11 | Paper |
Circular pattern matching with \(k\) mismatches
Journal of Computer and System Sciences | 2020-10-23 | Paper |
Longest common prefixes with k-mismatches and applications
SOFSEM 2018: Theory and Practice of Computer Science | 2020-10-21 | Paper |
Optimal computation of overabundant words
(available as arXiv preprint) | 2020-05-27 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
Faster algorithms for 1-mappability of a sequence
Theoretical Computer Science | 2020-02-20 | Paper |
| Property suffix array with applications | 2020-02-12 | Paper |
Almost optimal distance oracles for planar graphs
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Circular pattern matching with k mismatches
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Exact distance oracles for planar graphs with failing vertices
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On overabundant words and their application to biological sequence analysis
Theoretical Computer Science | 2019-10-07 | Paper |
Palindromic decompositions with gaps and errors
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
On-line weighted pattern matching
Information and Computation | 2019-05-02 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
Alignment-free sequence comparison using absent words
Information and Computation | 2018-09-27 | Paper |
How to answer a small batch of RMQs or LCA queries in practice
(available as arXiv preprint) | 2018-06-15 | Paper |
Faster algorithms for 1-mappability of a sequence
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Optimal computation of avoided words
(available as arXiv preprint) | 2018-03-23 | Paper |
Efficient enumeration of non-equivalent squares in partial words with few holes
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Palindromic decompositions with gaps and errors
(available as arXiv preprint) | 2017-08-22 | Paper |
