| 2009 | Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution. | Albert Atserias, Johannes Klaus Fichte, Marc Thurley |
| 2009 | Cardinality Networks and Their Applications. | Roberto Asn, Robert Nieuwenhuis, Albert Oliveras, Enric Rodrguez-Carbonell |
| 2009 | Sequential Encodings from Max-CSP into Partial Max-SAT. | Josep Argelich, Alba Cabiscol, Ins Lynce, Felip Many |
| 2009 | Solving (Weighted) Partial MaxSAT through Satisfiability Testing. | Carlos Anstegui, Maria Luisa Bonet, Jordi Levy |
| 2008 | Regular and General Resolution: An Improved Separation. | Alasdair Urquhart |
| 2008 | Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning. | Zbigniew Stachniak, Anton Belov |
| 2008 | How Many Conflicts Does It Need to Be Unsatisfiable? | Dominik Scheder, Philipp Zumstein |
| 2008 | Local Restarts. | Vadim Ryvchin, Ofer Strichman |
| 2008 | A CNF Class Generalizing Exact Linear Formulas. | Stefan Porschen, Ewald Speckenmeyer |
| 2008 | Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms. | Joo Marques-Silva, Vasco Manquinho |
| 2008 | SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. | Maarten Marin, Johan Wittocx, Marc Denecker, Maurice Bruynooghe |
| 2008 | Finding Guaranteed MUSes Fast. | Hans van Maaren, Siert Wieringa |
| 2008 | Nenofex: Expanding NNF for QBF Solving. | Florian Lonsing, Armin Biere |
| 2008 | Searching for Autarkies to Trim Unsatisfiable Clause Sets. | Mark H. Liffiton, Karem A. Sakallah |
| 2008 | Improvements to Hybrid Incremental SAT Algorithms. | Florian Letombe, Joo Marques-Silva |
| 2008 | A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors. | Stephan Kottler, Michael Kaufmann, Carsten Sinz |
| 2008 | Computation of Renameable Horn Backdoors. | Stephan Kottler, Michael Kaufmann, Carsten Sinz |
| 2008 | SAT, UNSAT and Coloring. | Kazuo Iwama |
| 2008 | A Max-SAT Inference-Based Pre-processing for Max-Clique. | Federico Heras, Javier Larrosa |
| 2008 | Online Estimation of SAT Solving Runtime. | Shai Haim, Toby Walsh |
| 2008 | A Decision-Making Procedure for Resolution-Based SAT-Solvers. | Eugene Goldberg |
| 2008 | Complexity and Algorithms for Well-Structured k-SAT Instances. | Konstantinos Georgiou, Periklis A. Papakonstantinou |
| 2008 | Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms. | Yong Gao |
| 2008 | SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers. | Germain Faure, Robert Nieuwenhuis, Albert Oliveras, Enric Rodrguez-Carbonell |
| 2008 | Attacking Bivium Using SAT Solvers. | Tobias Eibach, Enrico Pilz, Gunnar Vlkel |