| Answering regular path queries mediated by unrestricted SQ ontologies | 0 | 0.34 | 2023 |
| Threshold Queries in Theory and in the Wild. | 0 | 0.34 | 2022 |
| Finite Entailment of UCRPQs over ALC Ontologies. | 0 | 0.34 | 2022 |
| Stackless Processing of Streamed Trees | 0 | 0.34 | 2021 |
| PG-Keys: Keys for Property Graphs | 0 | 0.34 | 2021 |
| On Finite Entailment of Non-Local Queries in Description Logics | 0 | 0.34 | 2020 |
| On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles. | 0 | 0.34 | 2019 |
| On the semantics of Cypher's implicit group-by | 0 | 0.34 | 2019 |
| Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151). | 5 | 0.41 | 2018 |
| Finite Query Answering in Expressive Description Logics with Transitive Roles. | 0 | 0.34 | 2018 |
| Reasoning About Integrity Constraints for Tree-Structured Data. | 0 | 0.34 | 2018 |
| Three Easy Pieces on Schema Mappings for Tree-structured Data. | 0 | 0.34 | 2017 |
| Vertically Acyclic Conjunctive Queries over Trees. | 0 | 0.34 | 2016 |
| Schema Validation via Streaming Circuits. | 0 | 0.34 | 2016 |
| Research Directions for Principles of Data Management (Abridged). | 5 | 0.43 | 2016 |
| Index problems for game automata | 0 | 0.34 | 2015 |
| On the Weak Index Problem for Game Automata | 1 | 0.35 | 2015 |
| Containment of Monadic Datalog Programs via Bounded Clique-Width. | 3 | 0.39 | 2015 |
| Monadic Datalog and Regular Tree Pattern Queries. | 0 | 0.34 | 2014 |
| Synthesizing transformations from XML schema mappings. | 2 | 0.36 | 2014 |
| XML Schema Mappings: Data Exchange and Metadata Management | 4 | 0.41 | 2014 |
| Consistency of Injective Tree Patterns. | 1 | 0.35 | 2014 |
| Solutions in XML data exchange | 9 | 0.50 | 2013 |
| Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata | 8 | 0.69 | 2013 |
| Between tree patterns and conjunctive queries: is there tractability beyond acyclicity? | 2 | 0.38 | 2012 |
| Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings | 54 | 3.21 | 2011 |
| Definable Operations On Weakly Recognizable Sets of Trees. | 5 | 0.59 | 2011 |
| On the tradeoff between mapping and querying power in XML data exchange | 7 | 0.46 | 2010 |
| Certain answers for XML queries | 11 | 0.54 | 2010 |
| XML schema mappings | 23 | 0.89 | 2009 |
| The Wadge Hierarchy of Max-Regular Languages | 0 | 0.34 | 2009 |
| Linear game automata: decidable hierarchy problems for stripped-down alternating tree automata | 1 | 0.38 | 2009 |
| Weak index versus Borel rank | 2 | 0.37 | 2008 |
| The Wadge Hierarchy of Deterministic Tree Languages | 13 | 0.92 | 2008 |
| On the topological complexity of tree languages | 8 | 0.73 | 2008 |
| On the topological complexity of weakly recognizable tree languages | 10 | 0.66 | 2007 |
| On deciding topological classes of deterministic tree languages | 10 | 0.69 | 2005 |
