| 2011 | Generalized Conflict-Clause Strengthening for Satisfiability Solvers. | Allen Van Gelder |
| 2011 | Careful Ranking of Multiple Solvers with Timeouts and Ties. | Allen Van Gelder |
| 2011 | Phase Transitions in Knowledge Compilation: An Experimental Study. | Jian Gao, Minghao Yin, Ke Xu |
| 2011 | EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation. | Oliver Gableske, Marijn Heule |
| 2011 | Satisfiability Certificates Verifiable in Subexponential Time. | Evgeny Dantsin, Edward A. Hirsch |
| 2011 | Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. | Nadia Creignou, Frdric Olive, Johannes Schmidt |
| 2011 | Transformations into Normal Forms for Quantified Circuits. | Hans Kleine Bning, Xishun Zhao, Uwe Bubeck |
| 2011 | Parameterized Complexity of DPLL Search Procedures. | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria |
| 2011 | Model Counting Using the Inclusion-Exclusion Principle. | Huxley Bennett, Sriram Sankaranarayanan |
| 2011 | Minimally Unsatisfiable Boolean Circuits. | Anton Belov, Joo Marques-Silva |
| 2011 | On Freezing and Reactivating Learnt Clauses. | Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais |
| 2011 | Analyzing the Instances of the MaxSAT Evaluation. | Josep Argelich, Chu Min Li, Felip Many, Jordi Planes |
| 2011 | BDDs for Pseudo-Boolean Constraints - Revisited. | Ignasi Abo, Robert Nieuwenhuis, Albert Oliveras, Enric Rodrguez-Carbonell |
| 2011 | Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One. | Ignasi Abo, Morgan Deters, Robert Nieuwenhuis, Peter J. Stuckey |
| 2011 | Translating Pseudo-Boolean Constraints into CNF. | Amir Aavani |
| 2010 | Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT. | Dave A. D. Tompkins, Holger H. Hoos |
| 2010 | Enhanced Gaussian Elimination in DPLL-based SAT Solvers. | Mate Soos |
| 2010 | Bounds on Threshold of Regular Random | Vishwambhar Rathi, Erik Aurell, Lars K. Rasmussen, Mikael Skoglund |
| 2010 | Complexity Results for Linear XSAT-Problems. | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer |
| 2010 | The Seventh QBF Solvers Evaluation (QBFEVAL'10). | Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, Ins Lynce |
| 2010 | Exact Algorithms and Complexity. | Ramamohan Paturi |
| 2010 | On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem. | Denis Pankratov, Allan Borodin |
| 2010 | Statistical Methodology for Comparison of SAT Solvers. | Mladen Nikolic |
| 2010 | The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference. | Yehuda Naveh |
| 2010 | Simple but Hard Mixed Horn Formulas. | Gayathri Namasivayam, Miroslaw Truszczynski |