| Publication | Date of Publication | Type |
|---|
| Longest common substring with gaps and related problems | 2026-05-26 | Paper |
| LF successor: compact space indexing for order-isomorphic pattern matching | 2026-05-12 | Paper |
| Approximate suffix-prefix dictionary queries | 2026-05-12 | Paper |
| Finding an optimal alphabet ordering for Lyndon factorization is hard | 2026-04-21 | Paper |
Non-overlapping indexing in BWT-runs bounded space
Theoretical Computer Science | 2025-11-10 | Paper |
| 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
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Quantum time complexity and algorithms for pattern matching on labeled graphs
String Processing and Information Retrieval | 2023-08-04 | Paper |
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
Lecture Notes in Computer Science | 2023-03-09 | Paper |
| scientific article; zbMATH DE number 7651104 (Why is no real title available?) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651154 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance | 2023-02-07 | Paper |
The complexity of approximate pattern matching on de Bruijn graphs
(available as arXiv preprint) | 2022-08-30 | Paper |
| Co-linear chaining with overlaps and gap costs | 2022-08-30 | Paper |
| Categorical range reporting with frequencies | 2022-07-21 | Paper |
The heaviest induced ancestors problem: better data structures and applications
Algorithmica | 2022-06-28 | Paper |
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
On the complexity of recognizing Wheeler graphs
Algorithmica | 2022-03-22 | Paper |
I/O-optimal categorical 3-sided skyline queries
Theoretical Computer Science | 2021-11-18 | Paper |
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
Theoretical Computer Science | 2021-01-25 | Paper |
I/O-efficient data structures for non-overlapping indexing
Theoretical Computer Science | 2021-01-25 | Paper |
| The heaviest induced ancestors problem revisited | 2020-12-16 | Paper |
| Non-overlapping indexing -- cache obliviously | 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
Theoretical Computer Science | 2020-05-23 | Paper |
Ranked document selection
Theoretical Computer Science | 2020-02-20 | Paper |
A brief history of parameterized matching problems
Discrete Applied Mathematics | 2020-02-14 | Paper |
Succinct non-overlapping indexing
Algorithmica | 2020-01-16 | Paper |
On computing average common substring over run length encoded sequences
Fundamenta Informaticae | 2019-01-17 | Paper |
A linear space data structure for range LCP queries
Fundamenta Informaticae | 2019-01-17 | Paper |
Space-efficient indexes for forbidden extension queries
Journal of Discrete Algorithms | 2018-12-14 | Paper |
A linear-space data structure for range-LCP queries in poly-logarithmic time
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Ranked document retrieval for multiple patterns
Theoretical Computer Science | 2018-09-27 | Paper |
pBWT: achieving succinct data structures for parameterized pattern matching and related problems
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 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
Algorithmica | 2018-04-06 | Paper |
Position-restricted substring searching over small alphabets
Journal of Discrete Algorithms | 2017-11-09 | Paper |
| Space-efficient dictionaries for parameterized and order-preserving pattern matching | 2017-10-17 | Paper |
Space-time trade-offs for finding shortest unique substrings and maximal unique matches
Theoretical Computer Science | 2017-10-17 | Paper |
In-place algorithms for exact and approximate shortest unique substring problems
Theoretical Computer Science | 2017-08-24 | Paper |
| Forbidden Extension Queries | 2017-07-13 | Paper |
Top-k term-proximity in succinct space
Algorithmica | 2017-07-07 | Paper |
| Shared-constraint range reporting | 2017-06-13 | Paper |
Range selection and predecessor queries in data aware space and time
Journal of Discrete Algorithms | 2017-05-29 | Paper |
Less space: indexing for queries with wildcards
Theoretical Computer Science | 2016-06-27 | Paper |
Efficient Alignment Free Sequence Comparison with Bounded Mismatches
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Reporting consecutive substring occurrences under bounded gap constraints
Theoretical Computer Science | 2016-06-16 | Paper |
Document retrieval with one wildcard
Theoretical Computer Science | 2016-05-26 | Paper |
Optimal encodings for range majority queries
Algorithmica | 2016-04-06 | Paper |
Linear-space data structures for range frequency queries on arrays and trees
Algorithmica | 2016-03-23 | Paper |
An in-place framework for exact and approximate shortest unique substring queries
Lecture Notes in Computer Science | 2016-01-11 | Paper |
Succinct indexes for reporting discriminating and generic words
Theoretical Computer Science | 2015-10-08 | Paper |
Top-\(k\) term-proximity in succinct space
Algorithms and Computation | 2015-09-11 | Paper |
Ranked document retrieval with forbidden pattern
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Succinct Non-overlapping Indexing
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Dictionary matching with uneven gaps
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Reporting consecutive substring occurrences under bounded gap constraints
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Compressing dictionary matching index via sparsification technique
Algorithmica | 2015-07-10 | Paper |
Geometric BWT: compressed text indexing via sparse suffixes and range searching
Algorithmica | 2015-05-26 | Paper |
Low space data structures for geometric range mode query
Theoretical Computer Science | 2015-05-22 | Paper |
Bottom-\(k\) document retrieval
Journal of Discrete Algorithms | 2015-05-04 | Paper |
On hardness of several string indexing problems
Theoretical Computer Science | 2015-04-29 | Paper |
Succinct indexes for reporting discriminating and generic words
String Processing and Information Retrieval | 2015-02-10 | Paper |
Document retrieval with one wildcard
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Space-efficient frameworks for top-k string retrieval
Journal of the ACM | 2014-09-12 | Paper |
Ranked document selection
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Encodings for range majority queries
Combinatorial Pattern Matching | 2014-06-30 | Paper |
On Hardness of Several String Indexing Problems
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Indexed geometric jumbled pattern matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
New space/time tradeoffs for top-\(k\) document retrieval on sequences
Theoretical Computer Science | 2014-06-23 | Paper |
Compressed text indexing with wildcards
Journal of Discrete Algorithms | 2014-02-03 | Paper |
Top-k document retrieval in compact space and near-optimal time
Algorithms and Computation | 2014-01-14 | Paper |
Less space: indexing for queries with wildcards
Algorithms and Computation | 2014-01-14 | Paper |
Compressed property suffix trees
Information and Computation | 2013-12-13 | Paper |
Faster range LCP queries
String Processing and Information Retrieval | 2013-10-29 | Paper |
Linear-space data structures for range frequency queries on arrays and trees
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Top-k document retrieval in external memory
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Indexes for document retrieval with relevance
Lecture Notes in Computer Science | 2013-09-13 | Paper |
On position restricted substring searching in succinct space
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Succinct representations of weighted trees supporting path queries
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Space-efficient construction algorithm for the circular suffix tree
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Faster compressed dictionary matching
Theoretical Computer Science | 2013-03-04 | Paper |
Efficient algorithm for circular Burrows-Wheeler transform
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Document listing for queries with excluded pattern
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Towards an optimal space-and-query-time index for top-k document retrieval
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Succinct indexes for circular patterns
Algorithms and Computation | 2011-12-16 | Paper |
