| 2023 | TACAS | Transforming Quantified Boolean Formulas Using Biclique Covers. | Oliver Kullmann, Ankit Shukla |
| 2021 | SAT | Projection Heuristics for Binary Branchings Between Sum and Product. | Oliver Kullmann, Oleg Zaikin |
| 2019 | FMCAD | Autarkies for DQCNF. | Oliver Kullmann, Ankit Shukla |
| 2019 | SAT | On Computing the Union of MUSes. | Carlos Menca, Oliver Kullmann, Alexey Ignatiev, Joo Marques-Silva |
| 2018 | SAT | Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. | Hoda Abbasizanjani, Oliver Kullmann |
| 2017 | IJCAI | Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method. | Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek |
| 2016 | SAT | Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. | Marijn J. H. Heule, Oliver Kullmann, Victor W. Marek |
| 2015 | SAT | Computing Maximal Autarkies with Few and Simple Oracle Queries. | Oliver Kullmann, Joo Marques-Silva |
| 2014 | LATA | On SAT Representations of XOR Constraints. | Matthew Gwynne, Oliver Kullmann |
| 2014 | SAT | Unified Characterisations of Resolution Hardness Measures. | Olaf Beyersdorff, Oliver Kullmann |
| 2013 | SOFSEM | Generalising and Unifying SLUR and Unit-Refutation Completeness. | Matthew Gwynne, Oliver Kullmann |
| 2012 | SAT | On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets. | Oliver Kullmann, Xishun Zhao |
| 2011 | SAT | On Variables with Few Occurrences in Conjunctive Normal Forms. | Oliver Kullmann, Xishun Zhao |
| 2010 | SAT | Green-Tao Numbers and SAT. | Oliver Kullmann |
| 2010 | SAT | The Seventh QBF Solvers Evaluation (QBFEVAL'10). | Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Ins Lynce |
| 2007 | SAT | Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. | Oliver Kullmann |
| 2006 | SAT | Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. | Oliver Kullmann, Ins Lynce, Joo Marques-Silva |
| 2004 | SAT | Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. | Nicola Galesi, Oliver Kullmann |
| 2004 | SAT | Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. | Nicola Galesi, Oliver Kullmann |
| 2003 | SAT | The Combinatorics of Conflicts between Clauses. | Oliver Kullmann |