| 2024 | AAAI | A Compiler for Weak Decomposable Negation Normal Form. | Petr Illner, Petr Kucera |
| 2023 | CP | Binary Constraint Trees and Structured Decomposability. | Petr Kucera |
| 2022 | CPAIOR | Learning a Propagation Complete Formula. | Petr Kucera |
| 2021 | AAAI | Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings. | Petr Kucera, Petr Savick |
| 2020 | ISAIM | Approximating minimum representations of key Horn functions. | Kristf Brczi, Endre Boros, Ondrej Cepek, Petr Kucera, Kazuhisa Makino |
| 2020 | ISAIM | On the size of CNF formulas with high propagation strength. | Petr Kucera, Petr Savick |
| 2019 | SOFSEM | Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability. | Milos Chrom, Petr Kucera |
| 2017 | IJCAI | On Minimum Representations of Matched Formulas (Extended Abstract). | Ondrej Cepek, Stefan Gursk, Petr Kucera |
| 2017 | IJCAI | Generating Models of a Matched Formula With a Polynomial Delay (Extended Abstract). | Petr Savick, Petr Kucera |
| 2017 | SAT | A Lower Bound on CNF Encodings of the At-Most-One Constraint. | Petr Kucera, Petr Savick, Vojtech Vorel |
| 2016 | ISAIM | Generating models of a matched formula with a polynomial delay. | Petr Savick, Petr Kucera |
| 2014 | ISAIM | Hydras: Complexity on general graphs and a subclass of trees. | Petr Kucera |
| 2012 | ISAIM | Boolean functions with long prime implicants. | Ondrej Cepek, Petr Kucera, Stanislav Kurik |
| 2012 | ISAIM | On hierarchies over the SLUR class. | Vclav Vlcek, Toms Balyo, Stefan Gursk, Petr Kucera |
| 2012 | SOFSEM | Properties of SLUR Formulae. | Ondrej Cepek, Petr Kucera, Vclav Vlcek |