| Publication | Date of Publication | Type |
|---|
| Sparse regular expression matching | 2024-11-28 | Paper |
| Sliding window string indexing in streams | 2024-10-21 | Paper |
| Simple and robust dynamic two-dimensional convex hull | 2024-05-29 | Paper |
| Predecessor on the ultra-wide word RAM | 2024-05-27 | Paper |
| The fine-grained complexity of episode matching | 2024-05-06 | Paper |
| Predecessor on the Ultra-Wide Word RAM | 2024-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065455 | 2023-11-14 | Paper |
| String Indexing with Compressed Patterns | 2023-10-23 | Paper |
| Random access in persistent strings and segment selection | 2023-08-17 | Paper |
| The complexity of the co-occurrence problem | 2023-08-04 | Paper |
| Compressed communication complexity of longest common prefixes | 2023-07-28 | Paper |
| Gapped indexing for consecutive occurrences | 2023-06-14 | Paper |
| Gapped indexing for consecutive occurrences | 2023-04-11 | Paper |
| String Indexing with Compressed Patterns. | 2023-02-07 | Paper |
| Top Tree Compression of Tries. | 2023-02-03 | Paper |
| Partial sums on the ultra-wide word RAM | 2022-12-22 | Paper |
| From regular expression matching to parsing | 2022-10-24 | Paper |
| String indexing for top-\(k\) close consecutive occurrences | 2022-08-10 | Paper |
| From Regular Expression Matching to Parsing | 2022-07-21 | Paper |
| Partial sums on the ultra-wide word RAM | 2022-02-01 | Paper |
| Top tree compression of tries | 2022-01-18 | Paper |
| Approximation algorithms for the a priori traveling repairman | 2021-04-07 | Paper |
| Tight Bounds for Top Tree Compression | 2021-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111702 | 2020-05-27 | Paper |
| Deterministic Indexing for Packed Strings | 2020-05-25 | Paper |
| Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing | 2020-05-25 | Paper |
| Lempel-Ziv Compression in a Sliding Window | 2020-05-25 | Paper |
| Finger search in grammar-compressed strings | 2019-09-05 | Paper |
| Dynamic relative compression, dynamic partial sums, and substring concatenation | 2019-01-11 | Paper |
| A separation between RLSLPs and LZ77 | 2018-12-14 | Paper |
| Sparse Text Indexing in Small Space | 2018-11-05 | Paper |
| Minimum Makespan Multi-vehicle Dial-a-Ride | 2018-10-30 | Paper |
| Union-Find with Constant Time Deletions | 2018-10-30 | Paper |
| Locating depots for capacitated vehicle routing | 2018-05-23 | Paper |
| Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation | 2018-04-19 | Paper |
| Finger Search in Grammar-Compressed Strings | 2018-04-19 | Paper |
| Time-space trade-offs for Lempel-Ziv compressed indexing | 2018-02-06 | Paper |
| Distance labeling schemes for trees | 2017-12-19 | Paper |
| Boxed Permutation Pattern Matching. | 2017-10-17 | Paper |
| Subsequence automata with default transitions | 2017-07-13 | Paper |
| Fingerprints in compressed strings | 2017-05-26 | Paper |
| Substring range reporting | 2017-03-27 | Paper |
| Compressed subsequence matching and packed tree coloring | 2017-03-03 | Paper |
| Longest common extensions in trees | 2016-06-16 | Paper |
| Capacitated vehicle routing with nonuniform speeds | 2016-04-15 | Paper |
| Compressed Data Structures for Range Searching | 2016-04-08 | Paper |
| Subsequence automata with default transitions | 2016-03-10 | Paper |
| Longest Common Extensions in Trees | 2015-08-20 | Paper |
| Longest Common Extensions in Sublinear Space | 2015-08-20 | Paper |
| Tree compression with top trees | 2015-06-09 | Paper |
| String indexing for patterns with wildcards | 2015-02-05 | Paper |
| Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts | 2014-11-18 | Paper |
| The tree inclusion problem | 2014-09-09 | Paper |
| Compact q-gram profiling of compressed strings | 2014-08-26 | Paper |
| Compressed subsequence matching and packed tree coloring | 2014-06-30 | Paper |
| Time-space trade-offs for longest common extensions | 2014-04-01 | Paper |
| Fingerprints in compressed strings | 2013-08-12 | Paper |
| Stochastic Vehicle Routing with Recourse | 2013-08-12 | Paper |
| Sparse Suffix Tree Construction in Small Space | 2013-08-06 | Paper |
| Tree Compression with Top Trees | 2013-08-06 | Paper |
| Compact q-Gram Profiling of Compressed Strings | 2013-06-14 | Paper |
| String indexing for patterns with wildcards | 2012-08-14 | Paper |
| Time-Space Trade-Offs for Longest Common Extensions | 2012-08-14 | Paper |
| String matching with variable length gaps | 2012-08-10 | Paper |
| Longest Common Extensions via Fingerprinting | 2012-06-08 | Paper |
| Fast arc-annotated subsequence matching in linear space | 2012-04-26 | Paper |
| Locating Depots for Capacitated Vehicle Routing | 2011-08-17 | Paper |
| Substring Range Reporting | 2011-06-29 | Paper |
| Capacitated Vehicle Routing with Non-uniform Speeds | 2011-06-24 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Asymmetric \(k\)-center with minimum coverage | 2010-03-24 | Paper |
| Fast Arc-Annotated Subsequence Matching in Linear Space | 2010-01-28 | Paper |
| Minimum Makespan Multi-vehicle Dial-a-Ride | 2009-10-29 | Paper |
| Matching subsequences in trees | 2009-06-24 | Paper |
| Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts | 2008-06-17 | Paper |
| Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs | 2008-05-14 | Paper |
| Hardness of Preemptive Finite Capacity Dial-a-Ride | 2007-08-28 | Paper |
| Matching Subsequences in Trees | 2007-05-02 | Paper |
| Asymmetry in \(k\)-center variants | 2006-09-14 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046473 | 2004-08-12 | Paper |
| Strong normalization from weak normalization by translation into the lambda-I-calculus | 2004-03-15 | Paper |
