| No. |
Title |
Author |
Year |
| 1 |
Combinatorial and Algorithmic Aspects of Monadic Stability |
Dreier, Jan et al. |
2022 |
| 2 |
CSP Beyond Tractable Constraint Languages |
Dreier, Jan et al. |
2022 |
| 3 |
SAT Backdoors: Depth Beats Size |
Dreier, Jan et al. |
2022 |
| 4 |
First-Order Model-Checking in Random Graphs and Complex Networks |
Dreier, Jan et al. |
2020 |
| 5 |
Hard Problems on Random Graphs |
Dreier, Jan et al. |
2020 |
| 6 |
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size |
Dreier, Jan et al. |
2020 |
| 7 |
Hardness of FO Model-Checking on Random Graphs |
Dreier, Jan et al. |
2019 |
| 8 |
Motif Counting in Preferential Attachment Graphs |
Dreier, Jan et al. |
2019 |
| 9 |
The Complexity of Packing Edge-Disjoint Paths |
Dreier, Jan et al. |
2019 |
| 10 |
A Cryptographer's Conspiracy Santa |
Bultel, Xavier et al. |
2018 |
| 11 |
Physical Zero-Knowledge Proofs for Akari, Takuzu, Kakuro and KenKen |
Bultel, Xavier et al. |
2016 |
