| Publication | Date of Publication | Type |
|---|
| String factorization via prefix free families | 2024-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875567 | 2023-02-03 | Paper |
| Pattern matching in hypertext | 2022-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009597 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136259 | 2020-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110891 | 2020-05-25 | Paper |
| Can we recover the cover? | 2019-05-21 | Paper |
| Two-Dimensional Parameterized Matching | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4606316 | 2018-03-02 | Paper |
| On the succinct representation of equivalence classes | 2017-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365085 | 2017-09-29 | Paper |
| Conditional lower bounds for space/time tradeoffs | 2017-09-22 | Paper |
| Space-Efficient String Indexing for Wildcard Pattern Matching. | 2017-03-03 | Paper |
| Less space: indexing for queries with wildcards | 2016-06-27 | Paper |
| Two dimensional range minimum queries and Fibonacci lattices | 2016-06-16 | Paper |
| Efficient special cases of pattern matching with swaps | 2016-06-09 | Paper |
| Document retrieval with one wildcard | 2016-05-26 | Paper |
| Dynamic text and static pattern matching | 2015-09-02 | Paper |
| Clustered Integer 3SUM via Additive Combinatorics | 2015-08-21 | Paper |
| Longest Common Extensions in Sublinear Space | 2015-08-20 | Paper |
| Fast String Dictionary Lookup with One Error | 2015-08-20 | Paper |
| Range Minimum Query Indexes in Higher Dimensions | 2015-08-20 | Paper |
| Suffix trays and suffix trists: structures for faster text indexing | 2015-07-10 | Paper |
| Hypertext Searching - A Survey | 2015-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934605 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934639 | 2014-12-18 | Paper |
| Optimization problems in multiple-interval graphs | 2014-11-18 | Paper |
| Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing | 2014-11-14 | Paper |
| Document Retrieval with One Wildcard | 2014-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921688 | 2014-10-13 | Paper |
| Weighted Ancestors in Suffix Trees | 2014-10-08 | Paper |
| Improved Explicit Data Structures in the Bitprobe Model | 2014-10-08 | Paper |
| Finding witnesses by peeling | 2014-09-09 | Paper |
| Dotted interval graphs | 2014-09-09 | Paper |
| On Hardness of Jumbled Indexing | 2014-07-01 | Paper |
| Quick greedy computation for minimum common string partition | 2014-06-23 | Paper |
| Range LCP | 2014-06-10 | Paper |
| Generalized substring compression | 2014-03-13 | Paper |
| Less Space: Indexing for Queries with Wildcards | 2014-01-14 | Paper |
| Succinct Data Structures for Representing Equivalence Classes | 2014-01-14 | Paper |
| Orthogonal Range Searching for Text Indexing | 2013-09-13 | Paper |
| Finding the Minimum-Weight k-Path | 2013-08-12 | Paper |
| An efficient algorithm to test square-freeness of strings compressed by straight-line programs | 2012-10-23 | Paper |
| Two Dimensional Range Minimum Queries and Fibonacci Lattices | 2012-09-25 | Paper |
| Forbidden Patterns | 2012-06-29 | Paper |
| On demand string sorting over unbounded alphabets | 2012-05-30 | Paper |
| Range LCP | 2011-12-16 | Paper |
| Quick Greedy Computation for Minimum Common String Partitions | 2011-06-29 | Paper |
| Restricted Common Superstring and Restricted Common Supersequence | 2011-06-29 | Paper |
| Dictionary matching and indexing with errors and don't cares | 2010-08-15 | Paper |
| Approximate parameterized matching | 2010-08-14 | Paper |
| Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems | 2010-06-16 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| On the longest common rigid subsequence problem | 2010-02-23 | Paper |
| On the longest common parameterized subsequence | 2009-11-18 | Paper |
| Real two dimensional scaled matching | 2009-06-17 | Paper |
| Suffix trays and suffix trists: structures for faster text indexing | 2009-03-12 | Paper |
| Range Non-overlapping Indexing and Successive List Indexing | 2009-02-17 | Paper |
| A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem | 2009-02-12 | Paper |
| Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs | 2008-12-21 | Paper |
| On Demand String Sorting over Unbounded Alphabets | 2008-06-17 | Paper |
| Finding Witnesses by Peeling | 2008-06-17 | Paper |
| Two-Dimensional Range Minimum Queries | 2008-06-17 | Paper |
| Constrained LCS: Hardness and Approximation | 2008-06-17 | Paper |
| On the Longest Common Parameterized Subsequence | 2008-06-17 | Paper |
| Parameterized matching with mismatches | 2008-05-16 | Paper |
| Efficient one-dimensional real scaled matching | 2007-10-30 | Paper |
| Approximation and Online Algorithms | 2007-02-12 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Function Matching | 2006-06-01 | Paper |
| Constructive Bounds on Ordered Factorizations | 2006-06-01 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| An improved upper bound for the TSP in cubic 3-edge-connected graphs | 2005-08-25 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024776 | 2005-07-04 | Paper |
| Faster algorithms for string matching with k mismatches | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472453 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471354 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471382 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449230 | 2004-02-08 | Paper |
| A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP | 2004-01-08 | Paper |
| Overlap matching. | 2003-08-19 | Paper |
| Approximate swapped matching. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768267 | 2003-01-20 | Paper |
| Alternation and bounded concurrency are reverse equivalent. | 2003-01-14 | Paper |
| Real scaled matching | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768306 | 2002-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768309 | 2002-01-30 | Paper |
| Uniquely restricted matchings | 2001-10-14 | Paper |
| Text Indexing and Dictionary Matching with One Error | 2001-04-02 | Paper |
| Pattern Matching with Swaps | 2000-12-19 | Paper |
| New results on induced matchings | 2000-12-11 | Paper |
| Pattern Matching in Hypertext | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952702 | 2000-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952704 | 2000-05-10 | Paper |
| Inverse Pattern Matching | 1997-10-20 | Paper |
