- Complexity Issues Related to Propagation Completeness2013 | Faculty of Mathematics and Physics
- Learning a Propagation Complete Formula2022 | Faculty of Mathematics and Physics
- Propagation complete encodings of smooth DNNF theories2022 | Faculty of Mathematics and Physics
- Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings2021 | Faculty of Mathematics and Physics
- A Lower Bound on CNF Encodings of the At-Most-One Constraint2017 | Faculty of Mathematics and Physics
- A lower bound on CNF encodings of the at-most-one constraint2019 | Faculty of Mathematics and Physics
- On the size of CNF formulas with high propagation strength2020 | Faculty of Mathematics and Physics
- Bounds on the size of PC and URC formulas2020 | Faculty of Mathematics and Physics