| Publication | Date of Publication | Type |
|---|
| Near-optimal search time in \(\delta \)-optimal space, and vice versa | 2024-04-02 | Paper |
| Computing longest Lyndon subsequences and longest common Lyndon subsequences | 2024-03-25 | Paper |
| Toward a Definitive Compressibility Measure for Repetitive Sequences | 2024-03-19 | Paper |
| Dynamic suffix array with polylogarithmic queries and updates | 2023-12-08 | Paper |
| Improved dynamic algorithms for longest increasing subsequence | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084405 | 2023-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6075918 | 2023-09-20 | Paper |
| Efficient computation of sequence mappability | 2023-07-28 | Paper |
| Faster recovery of approximate periods over edit distance | 2023-07-28 | Paper |
| Near-optimal search time in \(\delta \)-optimal space | 2023-07-26 | Paper |
| Tight bound for the number of distinct palindromes in a tree | 2023-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874430 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874434 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874435 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874443 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874444 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874509 | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875583 | 2023-02-03 | Paper |
| Towards a definitive measure of repetitiveness | 2022-10-13 | Paper |
| Computing longest (common) Lyndon subsequences | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091065 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091271 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092429 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088916 | 2022-07-18 | Paper |
| Efficient representation and counting of antipower factors in words | 2022-06-13 | Paper |
| Efficient computation of sequence mappability | 2022-05-03 | Paper |
| A periodicity lemma for partial words | 2022-03-14 | Paper |
| Optimal-Time Dictionary-Compressed Indexes | 2022-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009593 | 2021-08-04 | Paper |
| Internal dictionary matching | 2021-06-30 | Paper |
| A Linear-Time Algorithm for Seeds Computation | 2021-05-03 | Paper |
| On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation | 2021-02-16 | Paper |
| Maximal unbordered factors of random strings | 2021-01-25 | Paper |
| Approximating text-to-pattern Hamming distances | 2021-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5140788 | 2020-12-16 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3304137 | 2020-08-05 | Paper |
| Universal reconstruction of a string | 2020-02-20 | Paper |
| String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure | 2020-01-30 | Paper |
| Circular pattern matching with \(k\) mismatches | 2020-01-30 | Paper |
| Indexing weighted sequences: neat and efficient | 2020-01-17 | Paper |
| String periods in the order-preserving model | 2020-01-17 | Paper |
| Dynamic dictionary matching in the online model | 2020-01-16 | Paper |
| Hardness of Approximation for Strip Packing | 2019-12-06 | Paper |
| Efficient representation and counting of antipower factors in words | 2019-12-04 | Paper |
| The streaming k-mismatch problem | 2019-10-15 | Paper |
| Deleting vertices to graphs of bounded genus | 2019-08-20 | Paper |
| Pattern matching and consensus problems on weighted sequences and profiles | 2019-06-27 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2019-06-06 | Paper |
| Correction to: ``Longest common substring with approximately \(k\) mismatches | 2019-05-21 | Paper |
| Longest common substring with approximately \(k\) mismatches | 2019-05-17 | Paper |
| A Linear-Time Algorithm for Seeds Computation | 2019-05-10 | Paper |
| On Abelian Longest Common Factor with and without RLE | 2019-01-17 | Paper |
| Linear search by a pair of distinct-speed robots | 2019-01-11 | Paper |
| Near-optimal computation of runs over general alphabet via non-crossing LCE queries | 2018-10-17 | Paper |
| Maximal unbordered factors of random strings | 2018-10-17 | Paper |
| Sparse Suffix Tree Construction in Optimal Time and Space | 2018-07-16 | Paper |
| On periodicity lemma for partial words | 2018-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636529 | 2018-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607988 | 2018-03-15 | Paper |
| On the string consensus problem and the Manhattan sequence consensus problem | 2018-02-16 | Paper |
| Efficient algorithms for shortest partial seeds in words | 2018-02-16 | Paper |
| String powers in trees | 2017-11-09 | Paper |
| Covering problems for partial words and for indeterminate strings | 2017-11-06 | Paper |
| Efficient enumeration of non-equivalent squares in partial words with few holes | 2017-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369536 | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369537 | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369563 | 2017-10-17 | Paper |
| Internal Pattern Matching Queries in a Text and Applications | 2017-10-05 | Paper |
| Wavelet Trees Meet Suffix Trees | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5351899 | 2017-08-31 | Paper |
| Efficient indexes for jumbled pattern matching with constant-sized alphabet | 2017-05-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965488 | 2017-03-03 | Paper |
| Fast computation of abelian runs | 2017-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957888 | 2017-01-30 | Paper |
| Linear Search by a Pair of Distinct-Speed Robots | 2016-12-01 | Paper |
| Fast algorithms for abelian periods in words and greatest common divisor queries | 2016-11-14 | Paper |
| Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence | 2016-10-28 | Paper |
| Maximum number of distinct and nonequivalent nonstandard squares in a word | 2016-09-12 | Paper |
| Computing minimal and maximal suffixes of a substring | 2016-06-16 | Paper |
| Order-preserving indexing | 2016-06-16 | Paper |
| Subquadratic-Time Algorithms for Abelian Stringology Problems | 2016-05-25 | Paper |
| A fast branching algorithm for cluster vertex deletion | 2016-03-09 | Paper |
| On the greedy algorithm for the shortest common superstring problem with reversals | 2016-01-05 | Paper |
| Approximating LZ77 via Small-Space Multiple-Pattern Matching | 2015-11-19 | Paper |
| Universal Reconstruction of a String | 2015-10-30 | Paper |
| Linear-time version of Holub's algorithm for morphic imprimitivity testing | 2015-09-25 | Paper |
| Covering problems for partial words and for indeterminate strings | 2015-09-11 | Paper |
| Fast algorithm for partial covers in words | 2015-09-03 | Paper |
| A note on the longest common compatible prefix problem for partial words | 2015-08-24 | Paper |
| String Powers in Trees | 2015-08-20 | Paper |
| On the String Consensus Problem and the Manhattan Sequence Consensus Problem | 2015-02-10 | Paper |
| An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph | 2014-12-09 | Paper |
| Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word | 2014-10-14 | Paper |
| Sublinear Space Algorithms for the Longest Common Substring Problem | 2014-10-08 | Paper |
| Efficient counting of square substrings in a tree | 2014-07-07 | Paper |
| Computing Minimal and Maximal Suffixes of a Substring Revisited | 2014-06-30 | Paper |
| Efficient Algorithms for Shortest Partial Seeds in Words | 2014-06-30 | Paper |
| Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence | 2014-06-30 | Paper |
| A Fast Branching Algorithm for Cluster Vertex Deletion | 2014-06-24 | Paper |
| Faster deterministic \textsc{Feedback Vertex Set} | 2014-06-23 | Paper |
| Enhanced string covering | 2014-01-16 | Paper |
| Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet | 2013-09-17 | Paper |
| Fast Algorithm for Partial Covers in Words | 2013-06-14 | Paper |
| Efficient Counting of Square Substrings in a Tree | 2013-03-21 | Paper |
| A note on efficient computation of all abelian periods in a string | 2013-03-20 | Paper |
| Linear-Time Version of Holub’s Algorithm for Morphic Imprimitivity Testing | 2013-03-18 | Paper |
| The Maximum Number of Squares in a Tree | 2012-08-14 | Paper |
