Answering Unions of Conjunctive Queries with Ideal Time Guarantees (Invited Talk) | 0 | 0.34 | 2022 |
Constructing Explainable Opinion Graphs from Reviews | 1 | 0.38 | 2021 |
Database Repairing with Soft Functional Dependencies | 0 | 0.34 | 2021 |
Efficiently Enumerating Minimal Triangulations | 0 | 0.34 | 2021 |
Tuple-Independent Representations of Infinite Probabilistic Databases | 0 | 0.34 | 2021 |
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries | 1 | 0.35 | 2021 |
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration | 1 | 0.35 | 2020 |
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. | 1 | 0.35 | 2020 |
ExtremeReader: An interactive explorer for customizable and explainable review summarization | 0 | 0.34 | 2020 |
On the Enumeration Complexity of Unions of Conjunctive Queries | 0 | 0.34 | 2018 |
Enumeration Complexity of Conjunctive Queries with Functional Dependencies. | 1 | 0.35 | 2018 |
Efficiently Enumerating Minimal Triangulations. | 0 | 0.34 | 2017 |
On the Enumeration of all Minimal Triangulations. | 1 | 0.36 | 2016 |
On the Enumeration of Tree Decompositions. | 0 | 0.34 | 2016 |