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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI