| Publication | Date of Publication | Type |
|---|
| PhyBWT: alignment-free phylogeny via eBWT positional clustering | 2024-08-13 | Paper |
| CAGE: cache-aware graphlet enumeration | 2024-05-29 | Paper |
| On strings having the same length-\(k\) substrings | 2024-05-06 | Paper |
| Polynomial-delay enumeration of maximal common subsequences | 2024-04-19 | Paper |
| Refined bounds on the number of Eulerian tours in undirected graphs | 2024-01-09 | Paper |
| Finding the cyclic covers of a string | 2023-11-24 | Paper |
| On the Complexity of String Matching for Graphs | 2023-10-23 | Paper |
| Compressed communication complexity of longest common prefixes | 2023-07-28 | Paper |
| Longest property-preserved common factor | 2023-07-28 | Paper |
| Finding the Anticover of a String | 2023-02-07 | Paper |
| Finding structurally and temporally similar trajectories in graphs | 2023-02-07 | Paper |
| Optimal deterministic protocols for mobile robots on a grid | 2022-12-09 | Paper |
| Proximity Search for Maximal Subgraph Enumeration | 2022-11-15 | Paper |
| Succinct representation for (non)deterministic finite automata | 2022-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092436 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091210 | 2022-07-21 | Paper |
| Degenerate string comparison and applications | 2022-07-18 | Paper |
| Beyond the BEST theorem: fast assessment of Eulerian trails | 2022-05-20 | Paper |
| Enumeration of maximal common subsequences between two strings | 2022-03-22 | Paper |
| K-plex cover pooling for graph neural networks | 2021-11-01 | Paper |
| Succinct representations for (non)deterministic finite automata | 2021-10-04 | Paper |
| Listing subgraphs by Cartesian decomposition | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009605 | 2021-08-04 | Paper |
| Comparing Degenerate Strings | 2021-05-20 | Paper |
| Listing Maximal Independent Sets with Minimal Space and Bounded Delay | 2021-02-16 | Paper |
| On-line pattern matching on similar texts | 2020-05-25 | Paper |
| Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs | 2020-04-14 | Paper |
| Longest property-preserved common factor: a new string-processing framework | 2020-02-20 | Paper |
| Efficient algorithms for listing \(k\) disjoint \(st\)-paths in graphs | 2020-02-12 | Paper |
| Large-scale clique cover of real-world networks | 2020-01-17 | Paper |
| A fast discovery algorithm for large common connected induced subgraphs | 2019-09-19 | Paper |
| Nearly tight bounds on the encoding length of the Burrows-Wheeler transform | 2019-09-16 | Paper |
| Fast Compressed Tries through Path Decompositions | 2019-09-12 | Paper |
| Optimal listing of cycles and \(st\)-paths in undirected graphs | 2019-05-15 | Paper |
| Listing Maximal Subgraphs Satisfying Strongly Accessible Properties | 2019-04-24 | Paper |
| On the construction of classes of suffix trees for square matrices: algorithms and applications | 2019-01-10 | Paper |
| Tight lower bounds for the number of inclusion-minimal \(st\)-cuts | 2018-11-22 | Paper |
| No sorting? Better searching! | 2018-11-05 | Paper |
| Asymptotically optimal encodings of range data structures for selection and top-\(k\) queries | 2018-11-05 | Paper |
| Finding maximal common subgraphs via time-space efficient reverse search | 2018-10-04 | Paper |
| New bounds for approximating extremal distances in undirected graphs | 2018-07-16 | Paper |
| Efficient splitting and merging algorithms for order decomposable problems | 2018-07-04 | Paper |
| Efficient enumeration of graph orientations with sources | 2018-06-27 | Paper |
| Motif trie: an efficient text index for pattern discovery with don't cares | 2018-02-16 | Paper |
| On bubble generators in directed graphs | 2018-01-04 | Paper |
| Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques | 2017-12-19 | Paper |
| Circular sequence comparison with \(q\)-grams | 2017-07-25 | Paper |
| Output-sensitive pattern extraction in sequences | 2017-04-25 | Paper |
| Fast compressed tries through path decompositions | 2016-10-24 | Paper |
| Directing Road Networks by Listing Strong Orientations | 2016-09-29 | Paper |
| Linear-size suffix tries | 2016-06-16 | Paper |
| Listing Acyclic Orientations of Graphs with Single and Multiple Sources | 2016-05-03 | Paper |
| Enumerating cyclic orientations of a graph | 2016-04-04 | Paper |
| When indexing equals compression | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501319 | 2015-08-03 | Paper |
| Computing the Burrows-Wheeler transform in place and in small space | 2015-05-04 | Paper |
| Managing unbounded-length keys in comparison-driven data structures with applications to online indexing | 2014-11-14 | Paper |
| Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs | 2014-10-08 | Paper |
| Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) | 2014-09-26 | Paper |
| Colored Range Searching in Linear Space | 2014-09-02 | Paper |
| Towards optimal packed string matching | 2014-03-13 | Paper |
| Simple real-time constant-space string matching | 2014-01-09 | Paper |
| On computing the diameter of real-world undirected graphs | 2013-12-11 | Paper |
| Encodings for range selection and top-\(k\) queries | 2013-09-17 | Paper |
| Random access to high-order entropy compressed text | 2013-09-13 | Paper |
| Dynamic Compressed Strings with Random Access | 2013-08-06 | Paper |
| A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform | 2013-06-14 | Paper |
| Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings | 2012-11-27 | Paper |
| Optimal packed string matching | 2012-08-31 | Paper |
| Constant-time word-size string matching | 2012-08-14 | Paper |
| More haste, less waste: lowering the redundancy in fully indexable dictionaries | 2012-04-24 | Paper |
| Output-sensitive listing of bounded-size trees in undirected graphs | 2011-09-16 | Paper |
| Counting the orderings for multisets in consecutive ones property and PQ-trees | 2011-07-29 | Paper |
| Simple real-time constant-space string matching | 2011-06-29 | Paper |
| A quick tour on suffix arrays and compressed suffix arrays | 2011-06-16 | Paper |
| A comparison of three algorithms for approximating the distance distribution in real-world graphs | 2011-05-12 | Paper |
| Optimal trade-offs for succinct string indexes | 2010-09-07 | Paper |
| Finding the diameter in real-world graphs. Experimentally turning a lower bound into an upper bound | 2010-09-06 | Paper |
| Squeezing succinct data structures into entropy bounds | 2010-08-16 | Paper |
| Optimal worst-case operations for implicit cache-oblivious search trees. | 2010-04-20 | Paper |
| Masking patterns in sequences: A new class of motif discovery with don't cares | 2009-10-09 | Paper |
| On the Size of Succinct Indices | 2008-09-25 | Paper |
| Amortized Rigidness in Dynamic Cartesian Trees | 2008-03-19 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Optimal implicit dictionaries over unbounded universes | 2006-10-25 | Paper |
| Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching | 2006-06-01 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| The string B-tree | 2005-01-25 | Paper |
| Implicit \(B\)-trees: A new data structure for the dictionary problem | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472452 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471381 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471357 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449185 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426347 | 2003-09-16 | Paper |
| Text sparsification via local maxima. | 2003-08-17 | Paper |
| Efficient splitting and merging algorithms for order decomposable problems. | 2003-01-14 | Paper |
| Optimal deterministic protocols for mobile robots on a grid | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234120 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527021 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252745 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945539 | 2000-03-23 | Paper |
| Parallel construction and query of index data structures for pattern matching on square matrices | 1999-05-11 | Paper |
| Improved Dynamic Text Indexing | 1999-05-11 | Paper |
| Simple planar graph partition into three forests | 1999-03-02 | Paper |
| On updating suffix tree labels | 1998-08-13 | Paper |
| Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms | 1998-06-11 | Paper |
| Optimal On-Line Search and Sublinear Time Update in String Matching | 1998-05-10 | Paper |
| On the construction of classes of suffix trees for square matrices: Algorithms and applications | 1997-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875209 | 1996-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886088 | 1996-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858444 | 1996-05-27 | Paper |
| On finding common subtrees | 1993-05-16 | Paper |
| A fast VLSI solution for approximate string matching | 1993-01-12 | Paper |
| Further comments on the subtree isomorphism for ordered trees | 1992-06-28 | Paper |
| A note on the subtree isomorphism for ordered trees and related problems | 1992-06-27 | Paper |
| Simple and efficient string matching with k mismatches | 1989-01-01 | Paper |
