| When is the Evaluation of Extended CRPQ Tractable? | 0 | 0.34 | 2022 |
| Finite Controllability for Ontology-Mediated Query Answering of CRPQ. | 0 | 0.34 | 2020 |
| Containment of UC2RPQ - The Hard and Easy Cases. | 0 | 0.34 | 2020 |
| Containment of Simple Conjunctive Regular Path Queries. | 0 | 0.34 | 2020 |
| Playing with Repetitions in Data Words Using Energy Games | 0 | 0.34 | 2020 |
| Semantic Optimization of Conjunctive Queries | 0 | 0.34 | 2020 |
| Universality Problem for Unambiguous VASS | 0 | 0.34 | 2020 |
| The Quantifier Alternation Hierarchy of Synchronous Relations. | 0 | 0.34 | 2019 |
| Boundedness of Conjunctive Regular Path Queries. | 0 | 0.34 | 2019 |
| Satisfiability of Xpath on data trees. | 0 | 0.34 | 2018 |
| Bisimulations on Data Graphs. | 1 | 0.36 | 2018 |
| Resynchronizing Classes of Word Relations. | 0 | 0.34 | 2018 |
| Logics of Repeating Values on Data Trees and Branching Counter Systems. | 1 | 0.36 | 2017 |
| Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. | 2 | 0.37 | 2017 |
| Sensitivity of Counting Queries. | 2 | 0.52 | 2016 |
| Semantically Acyclic Conjunctive Queries under Functional Dependencies. | 4 | 0.39 | 2016 |
| Path Logics for Querying Graphs: Combining Expressiveness and Efficiency | 5 | 0.43 | 2015 |
| Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization. | 6 | 0.50 | 2015 |
| Basic Model Theory of XPath on Data Trees. | 8 | 0.81 | 2014 |
| Synchronizing Relations on Words. | 1 | 0.35 | 2014 |
| Pattern logics and auxiliary relations | 3 | 0.38 | 2014 |
| Reasoning about Data Repetitions with Counter Systems | 9 | 0.48 | 2013 |
| Graph Logics with Rational Relations | 0 | 0.34 | 2013 |
| Graph Logics with Rational Relations | 3 | 0.39 | 2013 |
| On XPath with transitive axes and data tests | 4 | 0.44 | 2013 |
| Decidability of Downward XPath | 10 | 0.67 | 2012 |
| Decidable classes of documents for XPath. | 1 | 0.36 | 2012 |
| Alternating register automata on finite words and trees | 8 | 0.46 | 2012 |
| Graph Logics with Rational Relations and the Generalized Intersection Problem | 20 | 0.69 | 2012 |
| Satisfiability for two-variable logic with two successor relations on finite linear orders | 6 | 0.48 | 2012 |
| Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma | 48 | 1.69 | 2011 |
| Efficient evaluation for a temporal logic on changing XML documents | 1 | 0.36 | 2011 |
| The expressive power of memory logics | 12 | 0.88 | 2011 |
| A Decidable Two-Way Logic on Data Words | 9 | 0.55 | 2011 |
| Forward-XPath and extended register automata on data-trees | 11 | 0.66 | 2010 |
| Relating timed and register automata | 7 | 0.78 | 2010 |
| Future-Looking Logics on Data Words and Trees | 24 | 0.97 | 2009 |
| Tableaux and Model Checking for Memory Logics | 3 | 0.46 | 2009 |
| Satisfiability of downward XPath with data equality tests | 31 | 1.23 | 2009 |
| Expressive Power and Decidability for Memory Logics | 8 | 0.64 | 2008 |
