| Publication | Date of Publication | Type |
|---|
| A Researcher's Digest of GQL (invited talk) | 2024-10-08 | Paper |
| A Trichotomy for Regular Trail Queries | 2024-01-16 | Paper |
| Partial order multiway search | 2023-11-29 | Paper |
| The Complexity of Aggregates over Extractions by Regular Expressions | 2023-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874277 | 2023-02-07 | Paper |
| Weight Annotation in Information Extraction | 2023-02-07 | Paper |
| Formal languages in information extraction and graph databases | 2022-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028476 | 2022-02-09 | Paper |
| Learning algorithms | 2022-02-04 | Paper |
| Evaluation and enumeration problems for regular path queries | 2020-08-06 | Paper |
| Satisfiability for SCULPT-schemas for CSV-like data | 2020-08-06 | Paper |
| Minimization of tree patterns | 2019-02-25 | Paper |
| A characterization for decidable separability by piecewise testable languages | 2018-12-10 | Paper |
| Querying Graphs with Data | 2018-08-02 | Paper |
| MSO queries on trees: enumerating answers under updates | 2018-04-23 | Paper |
| Conjunctive query containment over trees using schema information | 2018-02-28 | Paper |
| Deciding definability by deterministic regular expressions | 2017-06-30 | Paper |
| Separability by short subsequences and subwords | 2017-06-13 | Paper |
| Deciding twig-definability of node selecting tree automata | 2016-04-18 | Paper |
| Closure properties and descriptional complexity of deterministic regular expressions | 2016-04-01 | Paper |
| A Note on Decidable Separability by Piecewise Testable Languages | 2015-09-29 | Paper |
| The complexity of regular expressions and property paths in SPARQL | 2015-09-03 | Paper |
| Simplifying XML schema: single-type approximations of regular tree languages | 2014-01-20 | Paper |
| Validity of tree pattern queries with respect to schema information | 2013-09-20 | Paper |
| Generating, sampling and counting subclasses of regular tree languages | 2013-08-23 | Paper |
| Efficient separability of regular languages by subsequences and suffixes | 2013-08-07 | Paper |
| Deciding definability by deterministic regular expressions | 2013-03-18 | Paper |
| Descriptional complexity of deterministic regular expressions | 2012-09-25 | Paper |
| Regular expressions with counting: weak versus strong determinism | 2012-05-30 | Paper |
| The tractability frontier for NFA minimization | 2012-05-11 | Paper |
| Conjunctive query containment over trees | 2011-05-04 | Paper |
| Deterministic top-down tree automata: past, present, and future | 2011-03-30 | Paper |
| Complexity of decision problems for XML schemas and chain regular expressions | 2010-09-06 | Paper |
| Optimizing Schema Languages for XML: Numerical Constraints and Interleaving | 2009-11-06 | Paper |
| Regular Expressions with Counting: Weak versus Strong Determinism | 2009-10-16 | Paper |
| Optimizing Conjunctive Queries over Trees Using Schema Information | 2009-02-03 | Paper |
| The Tractability Frontier for NFA Minimization | 2008-08-19 | Paper |
| Typechecking top-down XML transformations: Fixed input or output schemas | 2008-08-14 | Paper |
| On the minimization of XML schemas and tree automata for unranked trees | 2007-05-23 | Paper |
| Frontiers of tractability for typechecking simple XML transformations | 2007-04-26 | Paper |
| Database Programming Languages | 2006-10-20 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| On the complexity of typechecking top-down XML transformations | 2005-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414526 | 2003-07-25 | Paper |
