| Publication | Date of Publication | Type |
|---|
| Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization | 2024-11-28 | Paper |
| Suffix-prefix queries on a dictionary | 2024-10-21 | Paper |
| Feasibility of flow decomposition with subpath constraints in linear time | 2024-08-13 | Paper |
| Fully functional parameterized suffix trees in compact space | 2024-06-24 | Paper |
| Non-overlapping indexing in BWT-runs bounded space | 2024-05-29 | Paper |
| Simple reductions from formula-SAT to pattern matching on labeled graphs and subtree isomorphism | 2024-05-14 | Paper |
| Compact text indexing for advanced pattern matching problems: parameterized, order-isomorphic, 2D, etc. (invited talk) | 2024-05-06 | Paper |
| Range shortest unique substring queries | 2024-04-19 | Paper |
| Ranked Document Retrieval in External Memory | 2023-10-23 | Paper |
| Quantum time complexity and algorithms for pattern matching on labeled graphs | 2023-08-04 | Paper |
| Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis | 2023-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874481 | 2023-02-07 | Paper |
| The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874441 | 2023-02-07 | Paper |
| Co-linear chaining with overlaps and gap costs | 2022-08-30 | Paper |
| The complexity of approximate pattern matching on de Bruijn graphs | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091119 | 2022-07-21 | Paper |
| The heaviest induced ancestors problem: better data structures and applications | 2022-06-28 | Paper |
| On the Hardness and Inapproximability of Recognizing Wheeler Graphs | 2022-05-11 | Paper |
| On the complexity of recognizing Wheeler graphs | 2022-03-22 | Paper |
| I/O-optimal categorical 3-sided skyline queries | 2021-11-18 | Paper |
| I/O-efficient data structures for non-overlapping indexing | 2021-01-25 | Paper |
| A framework for designing space-efficient dictionaries for parameterized and order-preserving matching | 2021-01-25 | Paper |
| Non-Overlapping Indexing - Cache Obliviously | 2020-12-16 | Paper |
| The Heaviest Induced Ancestors Problem Revisited | 2020-12-16 | Paper |
| Structural Pattern Matching - Succinctly. | 2020-11-25 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2020-05-23 | Paper |
| Ranked document selection | 2020-02-20 | Paper |
| A brief history of parameterized matching problems | 2020-02-14 | Paper |
| Succinct non-overlapping indexing | 2020-01-16 | Paper |
| A Linear Space Data Structure for Range LCP Queries* | 2019-01-17 | Paper |
| On Computing Average Common Substring Over Run Length Encoded Sequences | 2019-01-17 | Paper |
| Space-efficient indexes for forbidden extension queries | 2018-12-14 | Paper |
| A linear-space data structure for range-LCP queries in poly-logarithmic time | 2018-10-04 | Paper |
| Ranked document retrieval for multiple patterns | 2018-09-27 | Paper |
| pBWT: Achieving Succinct Data Structures for Parameterized Pattern Matching and Related Problems | 2018-07-16 | Paper |
| Space-Time Trade-Offs for the Shortest Unique Substring Problem. | 2018-04-19 | Paper |
| Dictionary matching with a bounded gap in pattern or in text | 2018-04-06 | Paper |
| Position-restricted substring searching over small alphabets | 2017-11-09 | Paper |
| Space-time trade-offs for finding shortest unique substrings and maximal unique matches | 2017-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369534 | 2017-10-17 | Paper |
| In-place algorithms for exact and approximate shortest unique substring problems | 2017-08-24 | Paper |
| Forbidden Extension Queries | 2017-07-13 | Paper |
| Top-\(k\) term-proximity in succinct space | 2017-07-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5738940 | 2017-06-13 | Paper |
| Range selection and predecessor queries in data aware space and time | 2017-05-29 | Paper |
| Less space: indexing for queries with wildcards | 2016-06-27 | Paper |
| Efficient Alignment Free Sequence Comparison with Bounded Mismatches | 2016-06-22 | Paper |
| Reporting consecutive substring occurrences under bounded gap constraints | 2016-06-16 | Paper |
| Document retrieval with one wildcard | 2016-05-26 | Paper |
| Optimal encodings for range majority queries | 2016-04-06 | Paper |
| Linear-space data structures for range frequency queries on arrays and trees | 2016-03-23 | Paper |
| In-place algorithms for exact and approximate shortest unique substring problems | 2016-01-11 | Paper |
| Succinct indexes for reporting discriminating and generic words | 2015-10-08 | Paper |
| Top-$$k$$ Term-Proximity in Succinct Space | 2015-09-11 | Paper |
| Succinct Non-overlapping Indexing | 2015-08-20 | Paper |
| Dictionary Matching with Uneven Gaps | 2015-08-20 | Paper |
| Ranked Document Retrieval with Forbidden Pattern | 2015-08-20 | Paper |
| Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints | 2015-08-20 | Paper |
| Compressing dictionary matching index via sparsification technique | 2015-07-10 | Paper |
| Geometric BWT: compressed text indexing via sparse suffixes and range searching | 2015-05-26 | Paper |
| Low space data structures for geometric range mode query | 2015-05-22 | Paper |
| Bottom-\(k\) document retrieval | 2015-05-04 | Paper |
| On hardness of several string indexing problems | 2015-04-29 | Paper |
| Succinct Indexes for Reporting Discriminating and Generic Words | 2015-02-10 | Paper |
| Document Retrieval with One Wildcard | 2014-10-14 | Paper |
| Space-Efficient Frameworks for Top- k String Retrieval | 2014-09-12 | Paper |
| Ranked Document Selection | 2014-09-02 | Paper |
| Encodings for Range Majority Queries | 2014-06-30 | Paper |
| On Hardness of Several String Indexing Problems | 2014-06-30 | Paper |
| Indexed Geometric Jumbled Pattern Matching | 2014-06-30 | Paper |
| New space/time tradeoffs for top-\(k\) document retrieval on sequences | 2014-06-23 | Paper |
| Compressed text indexing with wildcards | 2014-02-03 | Paper |
| Less Space: Indexing for Queries with Wildcards | 2014-01-14 | Paper |
| Top-k Document Retrieval in Compact Space and Near-Optimal Time | 2014-01-14 | Paper |
| Compressed property suffix trees | 2013-12-13 | Paper |
| Faster Range LCP Queries | 2013-10-29 | Paper |
| Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees | 2013-09-20 | Paper |
| Top-k Document Retrieval in External Memory | 2013-09-17 | Paper |
| Indexes for Document Retrieval with Relevance | 2013-09-13 | Paper |
| Succinct representations of weighted trees supporting path queries | 2013-06-24 | Paper |
| On position restricted substring searching in succinct space | 2013-06-24 | Paper |
| Space-Efficient Construction Algorithm for the Circular Suffix Tree | 2013-06-14 | Paper |
| Faster compressed dictionary matching | 2013-03-04 | Paper |
| Document Listing for Queries with Excluded Pattern | 2012-08-14 | Paper |
| Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval | 2012-08-14 | Paper |
| Efficient Algorithm for Circular Burrows-Wheeler Transform | 2012-08-14 | Paper |
| Succinct Indexes for Circular Patterns | 2011-12-16 | Paper |
