| 2026 | SAT | On Proof Systems for #QBF (Short Paper). | Sravanthi Chede, Leroy Chew, Vaibhav Krishan, Anil Shukla |
| 2026 | SAT | Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking. | Leroy Chew, Toms Peitl |
| 2025 | AAAI | Proof Simulation via Round-based Strategy Extraction for QBF. | Leroy Chew |
| 2025 | CP | An Expansion-Based Approach for Quantified Integer Programming. | Michael Hartisch, Leroy Chew |
| 2025 | SAT | Better Extension Variables in DQBF via Independence. | Leroy Chew, Toms Peitl |
| 2024 | AAAI | Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. | Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider |
| 2024 | KR | ASP-QRAT: A Conditionally Optimal Dual Proof System for ASP. | Leroy Chew, Alexis de Colnet, Stefan Szeider |
| 2022 | STACS | Towards Uniform Certification in QBF. | Leroy Chew, Friedrich Slivovsky |
| 2022 | SAT | Relating Existing Powerful Proof Systems for QBF. | Leroy Chew, Marijn J. H. Heule |
| 2021 | SAT | Hardness and Optimality in QBF Proof Systems Modulo NP. | Leroy Chew |
| 2021 | SoCS | Avoiding Monochromatic Rectangles Using Shift Patterns. | Zhenjun Liu, Leroy Chew, Marijn J. H. Heule |
| 2020 | CADE | How QBF Expansion Makes Strategy Extraction Hard. | Leroy Chew, Judith Clymo |
| 2020 | SAT | Sorting Parity Encodings by Reusing Variables. | Leroy Chew, Marijn J. H. Heule |
| 2019 | SAT | Short Proofs in QBF Expansion. | Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan |
| 2019 | SAT | The Equivalences of Refutational QRAT. | Leroy Chew, Judith Clymo |
| 2016 | AAAI | Extension Variables in QBF Resolution. | Olaf Beyersdorff, Leroy Chew, Mikolas Janota |
| 2016 | STACS | Are Short Proofs Narrow? QBF Resolution is not Simple. | Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla |
| 2016 | SAT | Lifting QBF Resolution Calculi to DQBF. | Olaf Beyersdorff, Leroy Chew, Renate A. Schmidt, Martin Suda |
| 2015 | ICALP | Feasible Interpolation for QBF Resolution Calculi. | Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla |
| 2015 | LATA | A Game Characterisation of Tree-like Q-resolution Size. | Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah |
| 2015 | STACS | Proof Complexity of Resolution-based QBF Calculi. | Olaf Beyersdorff, Leroy Chew, Mikols Janota |
| 2014 | CADE | The Complexity of Theorem Proving in Circumscription and Minimal Entailment. | Olaf Beyersdorff, Leroy Chew |
| 2014 | MFCS | On Unification of QBF Resolution-Based Calculi. | Olaf Beyersdorff, Leroy Chew, Mikolas Janota |