| Publication | Date of Publication | Type |
|---|
| Optimal near-linear space heaviest induced ancestors | 2024-10-21 | Paper |
| Pattern masking for dictionary matching: theory and practice | 2024-05-30 | Paper |
| Longest palindromic substring in sublinear time | 2024-05-06 | Paper |
| Weighted shortest common supersequence problem revisited | 2024-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187833 | 2024-01-15 | Paper |
| Exact Distance Oracles for Planar Graphs with Failing Vertices | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075918 | 2023-09-20 | Paper |
| On the hardness of computing the edit distance of shallow trees | 2023-08-04 | Paper |
| Subsequence covers of words | 2023-08-04 | Paper |
| Efficient computation of sequence mappability | 2023-07-28 | Paper |
| Longest common prefixes with \(k\)-errors and applications | 2023-07-28 | Paper |
| On extended special factors of a word | 2023-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098776 | 2023-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6098782 | 2023-06-14 | Paper |
| Property Suffix Array with Applications in Indexing Weighted Sequences | 2023-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874434 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5874500 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875583 | 2023-02-03 | Paper |
| Efficient Enumeration of Distinct Factors Using Package Representations | 2022-12-22 | Paper |
| Internal shortest absent word queries in constant time and linear space | 2022-06-13 | Paper |
| Repetition Detection in a Dynamic String | 2022-05-11 | Paper |
| Longest common substring made fully dynamic | 2022-05-11 | Paper |
| Fault-tolerant distance labeling for planar graphs | 2022-05-10 | Paper |
| Efficient computation of sequence mappability | 2022-05-03 | Paper |
| Fault-tolerant distance labeling for planar graphs | 2022-03-22 | Paper |
| Single-source shortest paths and strong connectivity in dynamic planar graphs | 2021-11-25 | Paper |
| Internal dictionary matching | 2021-06-30 | Paper |
| Longest Common Factor After One Edit Operation | 2021-02-16 | Paper |
| Linear-Time Algorithm for Long LCF with k Mismatches | 2020-12-16 | Paper |
| Dynamic and internal longest common substring | 2020-11-11 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-10-23 | Paper |
| Longest Common Prefixes with k-Mismatches and Applications | 2020-10-21 | Paper |
| Optimal Computation of Overabundant Words | 2020-05-27 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2020-02-20 | Paper |
| Property suffix array with applications | 2020-02-12 | Paper |
| Almost optimal distance oracles for planar graphs | 2020-01-30 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-01-30 | Paper |
| Exact Distance Oracles for Planar Graphs with Failing Vertices | 2019-10-15 | Paper |
| On overabundant words and their application to biological sequence analysis | 2019-10-07 | Paper |
| Palindromic Decompositions with Gaps and Errors | 2019-06-24 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| On-line weighted pattern matching | 2019-05-02 | Paper |
| Alignment-free sequence comparison using absent words | 2018-09-27 | Paper |
| How to answer a small batch of RMQs or LCA queries in practice | 2018-06-15 | Paper |
| Faster algorithms for 1-mappability of a sequence | 2018-03-26 | Paper |
| Optimal computation of avoided words | 2018-03-23 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2017-10-23 | Paper |
| Palindromic decompositions with gaps and errors | 2017-08-22 | Paper |
| Optimal Bounds for Distinct Quartics | N/A | Paper |
