| No. |
Title |
Author |
Year |
| 1 |
Changing Partitions in Rectangle Decision Lists |
Mengel, Stefan |
2022 |
| 2 |
Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection |
Mengel, Stefan et al. |
2019 |
| 3 |
Constant-Delay Enumeration for Nondeterministic Document Spanners |
Amarilli, Antoine et al. |
2019 |
| 4 |
Tractable QBF by Knowledge Compilation |
Capelli, Florent et al. |
2019 |
| 5 |
Enumeration on Trees under Relabelings |
Amarilli, Antoine et al. |
2018 |
| 6 |
A Circuit-Based Approach to Efficient Enumeration |
Amarilli, Antoine et al. |
2017 |
| 7 |
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries |
Chen, Hubie et al. |
2015 |
| 8 |
Understanding Model Counting for beta-acyclic CNF-formulas |
Brault-Baron, Johann et al. |
2015 |
| 9 |
The arithmetic complexity of tensor contractions |
Capelli, Florent et al. |
2013 |
| 10 |
Monomials in arithmetic circuits: Complete problems in the counting hierarchy |
Fournier, Hervé et al. |
2012 |
