| Publication | Date of Publication | Type |
|---|
| A simple algorithm for consistent query answering under primary keys | 2024-10-08 | Paper |
| Enumeration for FO Queries over Nowhere Dense Graphs | 2023-04-27 | Paper |
| Order-Invariant First-Order Logic over Hollow Trees | 2023-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5101347 | 2022-08-30 | Paper |
| The power of programs over monoids in DA | 2020-05-26 | Paper |
| First-order queries on classes of structures with bounded expansion | 2020-05-12 | Paper |
| Nondeterminism and an abstract formulation of Nečiporuk's lower bound method | 2019-12-06 | Paper |
| Constant delay enumeration for FO queries over databases with local bounded expansion | 2018-07-18 | Paper |
| M. Grohe, Descriptive Complexity, Canonisation, and Definable Graph Structure Theory, Cambridge University Press, Cambridge, 2017, x + 544 pp. | 2018-05-17 | Paper |
| Bottom-up automata on data trees and vertical \(\mathsf{XPath}\) | 2017-12-11 | Paper |
| On first-order topological queries | 2017-06-13 | Paper |
| A glimpse on constant delay enumeration (invited talk) | 2017-03-03 | Paper |
| \(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems | 2016-04-28 | Paper |
| Guarded negation | 2016-03-24 | Paper |
| Datalog Rewritings of Regular Path Queries using Views | 2016-01-07 | Paper |
| Definable relations and first-order query languages over strings | 2015-11-12 | Paper |
| Two-variable logic on data trees and XML reasoning | 2015-11-11 | Paper |
| Deciding definability in \(\mathrm{FO}^2(<_{\mathbf{v}},<_{\mathbf{h}})\) on trees | 2015-10-29 | Paper |
| Capturing MSO with one quantifier | 2015-09-22 | Paper |
| Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\) | 2015-09-17 | Paper |
| Two-variable logic on data words | 2015-09-17 | Paper |
| Enumeration of monadic second-order queries on trees | 2015-09-17 | Paper |
| When is the evaluation of conjunctive queries tractable? | 2015-02-27 | Paper |
| Unary negation | 2013-09-26 | Paper |
| Piecewise testable tree languages | 2012-10-22 | Paper |
| A decidable characterization of locally testable tree languages | 2012-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113675 | 2012-01-23 | Paper |
| Automata based verification over linearly ordered data domains | 2012-01-23 | Paper |
| Unary negation | 2012-01-23 | Paper |
| Guarded negation | 2011-07-07 | Paper |
| Transitive closure logic, nested tree walking automata, and XPath | 2010-07-14 | Paper |
| Complementing deterministic tree-walking automata | 2010-01-29 | Paper |
| Future-Looking Logics on Data Words and Trees | 2009-10-16 | Paper |
| A Decidable Characterization of Locally Testable Tree Languages | 2009-07-14 | Paper |
| Towards a characterization of order-invariant queries over tame graphs | 2009-03-25 | Paper |
| Automata and Logics for Words and Trees over an Infinite Alphabet | 2009-03-12 | Paper |
| Expressive Power of Pebble Automata | 2009-03-12 | Paper |
| The complexity of XPath query evaluation and XML typing | 2008-12-21 | Paper |
| Complexity of Pebble Tree-Walking Automata | 2008-02-26 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| Active context-free games | 2006-10-25 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Order Independent Temporal Properties | 2004-10-15 | Paper |
| Handling Interpolated Data | 2004-09-06 | Paper |
| Building a constraint-based spatial database system: Model, languages, and implementation. | 2003-08-13 | Paper |
| Reachability and connectivity queries in constraint databases | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792775 | 2003-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729901 | 2001-09-30 | Paper |
| Querying spatial databases via topological invariants | 2000-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508947 | 2000-10-10 | Paper |
