| No. |
Title |
Author |
Year |
| 1 |
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051) |
Atserias, Albert et al. |
2022 |
| 2 |
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width |
Berkholz, Christoph et al. |
2019 |
| 3 |
Answering UCQs under Updates and in the Presence of Integrity Constraints |
Berkholz, Christoph et al. |
2018 |
| 4 |
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs |
Berkholz, Christoph |
2018 |
| 5 |
Answering FO+MOD Queries Under Updates on Bounded Degree Databases |
Berkholz, Christoph et al. |
2017 |
| 6 |
Supercritical Space-Width Trade-Offs for Resolution |
Berkholz, Christoph et al. |
2016 |
| 7 |
Parameterized Complexity of Fixed Variable Logics |
Berkholz, Christoph et al. |
2014 |
| 8 |
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy |
Berkholz, Christoph et al. |
2013 |
