| 2021 | SAT | Davis and Putnam Meet Henkin: Solving DQBF with Resolution. | Joshua Blinkhorn, Toms Peitl, Friedrich Slivovsky |
| 2020 | LICS | Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. | Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan |
| 2020 | SAT | Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. | Olaf Beyersdorff, Joshua Blinkhorn, Toms Peitl |
| 2019 | STACS | Building Strategies into QBF Proofs. | Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan |
| 2019 | SAT | Proof Complexity of QBF Symmetry Recomputation. | Joshua Blinkhorn, Olaf Beyersdorff |
| 2018 | IJCAI | Dynamic Dependency Awareness for QBF. | Joshua Blinkhorn, Olaf Beyersdorff |
| 2018 | STACS | Genuine Lower Bounds for QBF Expansion. | Olaf Beyersdorff, Joshua Blinkhorn |
| 2017 | SAT | Shortening QBF Proofs with Dependency Schemes. | Joshua Blinkhorn, Olaf Beyersdorff |
| 2016 | CP | Dependency Schemes in QBF Calculi: Semantics and Soundness. | Olaf Beyersdorff, Joshua Blinkhorn |
| 2016 | SAT | Dependency Schemes in QBF Calculi: Semantics and Soundness. | Joshua Blinkhorn, Olaf Beyersdorff |