| Publication | Date of Publication | Type |
|---|
| Distributional learning of regular formal graph system of bounded degree | 2019-09-16 | Paper |
| Graph contraction pattern matching for graphs of bounded treewidth | 2016-01-11 | Paper |
| Efficient pattern matching on graph patterns of bounded treewidth | 2013-07-23 | Paper |
| Learning Unordered Tree Contraction Patterns in Polynomial Time | 2013-06-14 | Paper |
| Graph pattern matching with expressive outerplanar graph patterns | 2011-04-13 | Paper |
| Learning block-preserving graph patterns and its application to data mining | 2010-10-07 | Paper |
| An effective grammar-based compression algorithm for tree structured data. | 2010-02-23 | Paper |
| Efficient learning of unlabeled term trees with contractible variables from positive data. | 2010-02-23 | Paper |
| Efficient learning of ordered and unordered tree patterns with contractible variables | 2010-02-23 | Paper |
| Learning of finite unions of tree patterns with repeated internal structured variables from queries | 2010-02-23 | Paper |
| Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining | 2008-12-02 | Paper |
| Exact Learning of Finite Unions of Graph Patterns from Queries | 2008-08-19 | Paper |
| Mining of Frequent Block Preserving Outerplanar Graph Structured Patterns | 2008-03-28 | Paper |
| A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns | 2007-11-13 | Paper |
| Inductive Logic Programming | 2006-11-01 | Paper |
| Ordered term tree languages which are polynomial time inductively inferable from positive data | 2006-03-20 | Paper |
| Combinatorial Pattern Matching | 2005-12-14 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046705 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739215 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739217 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736045 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473237 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424039 | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4424066 | 2003-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420654 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420750 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415196 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413498 | 2003-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782721 | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548332 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768551 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4524836 | 2001-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505384 | 2000-09-27 | Paper |
| Period lengths of cellular automata on square lattices with rule 90 | 2000-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937173 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703872 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703879 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370226 | 1998-01-14 | Paper |
| Using maximal independent sets to solve problems in parallel | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4306227 | 1994-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694725 | 1993-06-29 | Paper |
| A P-complete language describable with iterated shuffle | 1993-01-16 | Paper |
| The lexicographically first topological order problem is NLOG-complete | 1989-01-01 | Paper |
