| Publication | Date of Publication | Type |
|---|
| Optimally computing compressed indexing arrays based on the compact directed acyclic word graph | 2024-05-29 | Paper |
| Cartesian tree subsequence matching | 2024-05-06 | Paper |
| Fast identification of heavy hitters by cached and packed group testing | 2024-04-19 | Paper |
| Learning unions of tree patterns using queries | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090998 | 2022-07-21 | Paper |
| Efficient enumeration of dominating sets for sparse graphs | 2021-09-15 | Paper |
| A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number | 2021-06-22 | Paper |
| Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression | 2021-02-16 | Paper |
| Fully-online suffix tree and directed acyclic word graph construction for multiple texts | 2020-04-01 | Paper |
| An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs | 2020-02-25 | Paper |
| DenseZDD: a compact and fast index for families of sets | 2019-10-30 | Paper |
| Efficient enumeration of subgraphs and induced subgraphs with bounded girth | 2018-09-06 | Paper |
| Fully-online Construction of Suffix Trees for Multiple Texts. | 2017-10-17 | Paper |
| Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing | 2016-09-29 | Paper |
| Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations | 2016-09-12 | Paper |
| The Complexity of Induced Tree Reconfiguration Problems | 2016-04-13 | Paper |
| Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph | 2015-09-11 | Paper |
| Counterexamples to the long-standing conjecture on the complexity of BDD binary operations | 2012-10-23 | Paper |
| Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application | 2012-09-25 | Paper |
| Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism | 2012-09-13 | Paper |
| Sparse and Truncated Suffix Trees on Variable-Length Codes | 2011-06-29 | Paper |
| Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism | 2011-05-19 | Paper |
| Efficient algorithms for discovering frequent and maximal substructures from large semistructured data | 2010-10-06 | Paper |
| Inductive inference of unbounded unions of pattern languages from positive data | 2010-04-27 | Paper |
| An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence | 2007-07-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Inductive Logic Programming | 2006-11-01 | Paper |
| Discovery Science | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737683 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044556 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044487 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736059 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473562 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470562 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405997 | 2003-06-25 | Paper |
| Learning elementary formal systems with queries. | 2003-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796161 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548305 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547749 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547746 | 2002-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754020 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505391 | 2000-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942639 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703452 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703455 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703850 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253336 | 1999-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267804 | 1999-10-24 | Paper |
| Finding tree patterns consistent with positive and negative examples using queries | 1999-01-06 | Paper |
| Learning unions of tree patterns using queries | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370231 | 1998-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3126927 | 1997-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3143039 | 1993-12-20 | Paper |
