| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6147419 | 2024-01-15 | Paper |
| On the hardness of computing the edit distance of shallow trees | 2023-08-04 | Paper |
| Compressed range minimum queries | 2023-07-28 | Paper |
| Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can) | 2023-04-26 | Paper |
| Top Tree Compression of Tries. | 2023-02-03 | Paper |
| Fault-tolerant distance labeling for planar graphs | 2022-05-10 | Paper |
| Fault-tolerant distance labeling for planar graphs | 2022-03-22 | Paper |
| Top tree compression of tries | 2022-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009573 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002740 | 2021-07-28 | Paper |
| A Faster FPTAS for #Knapsack | 2021-07-28 | Paper |
| Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search | 2021-05-03 | Paper |
| Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time | 2021-04-14 | Paper |
| Incremental distance products via faulty shortest paths | 2020-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111728 | 2020-05-27 | Paper |
| Compressed range minimum queries | 2020-02-20 | Paper |
| Almost optimal distance oracles for planar graphs | 2020-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633831 | 2019-05-06 | Paper |
| Approximating the Diameter of Planar Graphs in Near Linear Time | 2018-10-30 | Paper |
| Bookmarks in grammar-compressed strings | 2018-10-17 | Paper |
| Improved bounds for randomized preemptive online matching | 2018-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607913 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607914 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607915 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607916 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607965 | 2018-03-15 | Paper |
| The nearest colored node in a tree | 2018-02-16 | Paper |
| Faster shortest paths in dense distance graphs, with applications | 2018-02-16 | Paper |
| The Nearest Colored Node in a Tree | 2017-10-17 | Paper |
| Optimal Distance Labeling Schemes for Trees | 2017-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365049 | 2017-09-29 | Paper |
| On Cartesian trees and range minimum queries | 2017-05-17 | Paper |
| Improved Bounds for Online Preemptive Matching | 2017-01-30 | Paper |
| Longest common extensions in trees | 2016-06-16 | Paper |
| Binary jumbled pattern matching on trees and tree-like structures | 2015-11-19 | Paper |
| Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search | 2015-10-27 | Paper |
| Longest Common Extensions in Trees | 2015-08-20 | Paper |
| Random Access to Grammar-Compressed Strings and Trees | 2015-06-11 | Paper |
| Tree compression with top trees | 2015-06-09 | Paper |
| Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication | 2014-12-05 | Paper |
| An optimal decomposition algorithm for tree edit distance | 2014-11-18 | Paper |
| Shortest paths in directed planar graphs with negative lengths | 2014-11-18 | Paper |
| Consequences of Faster Alignment of Sequences | 2014-07-01 | Paper |
| Improved Submatrix Maximum Queries in Monge Matrices | 2014-07-01 | Paper |
| Towards optimal packed string matching | 2014-03-13 | Paper |
| Approximating the maximum consecutive subsums of a sequence | 2014-03-13 | Paper |
| Binary Jumbled Pattern Matching on Trees and Tree-Like Structures | 2013-09-17 | Paper |
| Tree Compression with Top Trees | 2013-08-06 | Paper |
| Approximating the Diameter of Planar Graphs in Near Linear Time | 2013-08-06 | Paper |
| The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs | 2013-04-08 | Paper |
| A note on exact distance labeling | 2013-04-04 | Paper |
| Unified compression-based acceleration of edit-distance computation | 2013-03-05 | Paper |
| Optimal Packed String Matching | 2012-08-31 | Paper |
| Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence | 2012-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5390005 | 2012-04-24 | Paper |
| Distance Oracles for Vertex-Labeled Graphs | 2011-07-07 | Paper |
| Fast RNA structure alignment for crossing input structures | 2011-05-03 | Paper |
| Computing the Girth of a Planar Graph in $O(n \logn)$ Time | 2011-04-15 | Paper |
| The Stackelberg minimum spanning tree game | 2011-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579429 | 2010-08-06 | Paper |
| Indexing a Dictionary for Subset Matching Queries | 2010-05-04 | Paper |
| Fast algorithms for computing tree LCS | 2009-10-09 | Paper |
| Speeding up HMM decoding and training by exploiting sequence repetitions | 2009-08-27 | Paper |
| On Cartesian Trees and Range Minimum Queries | 2009-07-14 | Paper |
| Computing the Girth of a Planar Graph in O(n logn) Time | 2009-07-14 | Paper |
| Fast RNA Structure Alignment for Crossing Input Structures | 2009-07-07 | Paper |
| The Stackelberg Minimum Spanning Tree Game | 2009-02-17 | Paper |
| Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions | 2008-06-17 | Paper |
| Fast Algorithms for Computing Tree LCS | 2008-06-17 | Paper |
| An Optimal Decomposition Algorithm for Tree Edit Distance | 2007-11-28 | Paper |
| Local Alignment of RNA Sequences with Arbitrary Scoring Schemes | 2007-09-14 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
