Das SAT-Problem: ein systematischer Ansatz für effiziente Algorithmen zum aussagenlogischen Erfüllbarkeitsproblem, ausgehend von neuen Instrumenten der "worst case"-Analyse. - Oliver Kullmann (1997)

On a Generalization of Extended Resolution. - Oliver Kullmann (Discret. Appl. Math., 1999)

Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs - Oliver Kullmann (Electron. Colloquium Comput. Complex., 1999)

New Methods for 3-SAT Decision and Worst-case Analysis. - Oliver Kullmann (Theor. Comput. Sci., 1999)

An improved version of width restricted resolution. - Oliver Kullmann (AI&M, 2000)

Investigations on autark assignments. - Oliver Kullmann (Discret. Appl. Math., 2000)

An application of matroid theory to the SAT problem - Oliver Kullmann (Electron. Colloquium Comput. Complex., 2000)

On the use of autarkies for satisfiability decision. - Oliver Kullmann (Electron. Notes Discret. Math., 2001)

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. - Herbert Fleischner; Oliver Kullmann; Stefan Szeider (Theor. Comput. Sci., 2002)

The Combinatorics of Conflicts between Clauses. - Oliver Kullmann (SAT, 2003)

Lean clause-sets: generalizations of minimally unsatisfiable clause-sets. - Oliver Kullmann (Discret. Appl. Math., 2003)

Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. - Nicola Galesi; Oliver Kullmann (SAT (Selected Papers, 2004)

Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems. - Oliver Kullmann (Ann. Math. Artif. Intell., 2004)

Constraint satisfaction problems in clausal form: Autarkies, minimal unsatisfiability, and applications to hypergraph inequalities. - Oliver Kullmann (Complexity of Constraints, 2006)

Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel. - Oliver Kullmann; Inês Lynce; João Marques-Silva 001 (SAT, 2006)

The SAT 2005 Solver Competition on Random Instances. - Oliver Kullmann (J. Satisf. Boolean Model. Comput., 2006)

Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices. - Oliver Kullmann (SAT, 2007)

Constraint satisfaction problems in clausal form: Autarkies and minimal unsatisfiability. - Oliver Kullmann (Electron. Colloquium Comput. Complex., 2007)

Present and Future of Practical SAT Solving. - Oliver Kullmann (Complexity of Constraints, 2008)

Minimal Unsatisfiability and Autarkies. - Hans Kleine Büning; Oliver Kullmann (Handbook of Satisfiability, 2009)

Fundaments of Branching Heuristics. - Oliver Kullmann (Handbook of Satisfiability, 2009)

Green-Tao Numbers and SAT. - Oliver Kullmann (SAT, 2010)

The Seventh QBF Solvers Evaluation (QBFEVAL'10). - Claudia Peschiera; Luca Pulina; Armando Tacchella; Uwe Bubeck; Oliver Kullmann; Inês Lynce (SAT, 2010)

Exact Ramsey Theory: Green-Tao numbers and SAT - Oliver Kullmann (CoRR, 2010)

Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads. - Marijn Heule; Oliver Kullmann; Siert Wieringa; Armin Biere (Haifa Verification Conference, 2011)

On Variables with Few Occurrences in Conjunctive Normal Forms. - Oliver Kullmann; Xishun Zhao (SAT, 2011)

On the van der Waerden numbers w(2;3,t) - Tanbir Ahmed; Oliver Kullmann; Hunter S. Snevily (CoRR, 2011)

Constraint satisfaction problems in clausal form - Oliver Kullmann (CoRR, 2011)

Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency. - Oliver Kullmann (Fundam. Informaticae, 2011)

Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure. - Oliver Kullmann (Fundam. Informaticae, 2011)

SAT Interactions (Dagstuhl Seminar 12471). - Nadia Creignou; Nicola Galesi; Oliver Kullmann; Heribert Vollmer (Dagstuhl Reports, 2012)

Generalising and Unifying SLUR and Unit-Refutation Completeness. - Matthew Gwynne; Oliver Kullmann (SOFSEM, 2013)

Trading inference effort versus size in CNF Knowledge Compilation. - Matthew Gwynne; Oliver Kullmann (CoRR, 2013)

Hardness measures and resolution lower bounds. - Oliver Kullmann (CoRR, 2013)

Towards a theory of good SAT representations - Matthew Gwynne; Oliver Kullmann (CoRR, 2013)

On Davis-Putnam reductions for minimally unsatisfiable clause-sets. - Oliver Kullmann; Xishun Zhao (Theor. Comput. Sci., 2013)

On SAT Representations of XOR Constraints. - Matthew Gwynne; Oliver Kullmann (LATA, 2014)

Unified Characterisations of Resolution Hardness Measures. - Olaf Beyersdorff; Oliver Kullmann (SAT, 2014)

A framework for good SAT translations, with applications to CNF representations of XOR constraints. - Matthew Gwynne; Oliver Kullmann (CoRR, 2014)

Bounds for variables with few occurrences in conjunctive normal forms. - Oliver Kullmann; Xishun Zhao (CoRR, 2014)

On the van der Waerden numbers w(2; 3, t). - Tanbir Ahmed; Oliver Kullmann; Hunter S. Snevily (Discret. Appl. Math., 2014)

Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution. - Matthew Gwynne; Oliver Kullmann (J. Autom. Reason., 2014)

Computing Maximal Autarkies with Few and Simple Oracle Queries. - Oliver Kullmann; João Marques-Silva 001 (SAT, 2015)

Parameters for minimal unsatisfiability: Smarandache primitive numbers and full clauses. - Oliver Kullmann; Xishun Zhao (CoRR, 2015)

Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer. - Marijn J. H. Heule; Oliver Kullmann; Victor W. Marek (SAT, 2016)

Minimal unsatisfiability and deficiency: recent developments. - Oliver Kullmann (CoRR, 2016)

Unsatisfiable hitting clause-sets with three more clauses than variables. - Oliver Kullmann; Xishun Zhao (CoRR, 2016)

Solving Very Hard Problems: Cube-and-Conquer, a Hybrid SAT Solving Method. - Marijn J. H. Heule; Oliver Kullmann; Victor W. Marek (IJCAI, 2017)

The science of brute force. - Marijn J. H. Heule; Oliver Kullmann (Commun. ACM, 2017)

Cube-and-Conquer for Satisfiability. - Marijn J. H. Heule; Oliver Kullmann; Armin Biere (Handbook of Parallel Constraint Reasoning, 2018)

Minimal Unsatisfiability and Minimal Strongly Connected Digraphs. - Hoda Abbasizanjani; Oliver Kullmann (SAT, 2018)

Autarkies for DQCNF. - Oliver Kullmann; Ankit Shukla 003 (FMCAD, 2019)

On Computing the Union of MUSes. - Carlos Mencía; Oliver Kullmann; Alexey Ignatiev; João Marques-Silva 001 (SAT, 2019)

Introducing Autarkies for DQCNF. - Oliver Kullmann; Ankit Shukla 003 (CoRR, 2019)

Classification of minimally unsatisfiable 2-CNFs. - Hoda Abbasizanjani; Oliver Kullmann (CoRR, 2020)

Projection Heuristics for Binary Branchings Between Sum and Product. - Oliver Kullmann; Oleg Zaikin 002 (SAT, 2021)

Minimal Unsatisfiability and Autarkies. - Hans Kleine Büning; Oliver Kullmann (Handbook of Satisfiability, 2021)

Fundaments of Branching Heuristics. - Oliver Kullmann (Handbook of Satisfiability, 2021)

Scalable N-Queens Solving on GPGPUs via Interwarp Collaborations. - Filippos Pantekis; Phillip James; Oliver Kullmann (CANDAR, 2022)

Transforming Quantified Boolean Formulas Using Biclique Covers. - Oliver Kullmann; Ankit Shukla 003 (TACAS (2), 2023)

Optimized massively parallel solving of N-Queens on GPGPUs. - Filippos Pantekis; Phillip James; Oliver Kullmann; Liam O'Reilly (Concurr. Comput. Pract. Exp., 2024)