| 2012 | The Community Structure of SAT Formulas. | Carlos Anstegui, Jess Girldez-Cru, Jordi Levy |
| 2012 | Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. | Dimitris Achlioptas, Ricardo Menchaca-Mndez |
| 2012 | Using Term Rewriting to Solve Bit-Vector Arithmetic Problems - (Poster Presentation). | Iago Abal, Alcino Cunha, Joe Hurd, Jorge Sousa Pinto |
| 2011 | Connecting SAT Algorithms and Complexity Lower Bounds. | Ryan Williams |
| 2011 | Captain Jack: New Variable Selection Heuristics in Local Search for SAT. | Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos |
| 2011 | A Compact and Efficient SAT-Encoding of Finite Domain CSP. | Tomoya Tanjo, Naoyuki Tamura, Mutsunori Banbara |
| 2011 | A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs. | Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen |
| 2011 | Learning Polarity from Structure in SAT. | Bryan Silverthorn, Risto Miikkulainen |
| 2011 | On Improving MUS Extraction Algorithms. | Joo Marques-Silva, Ins Lynce |
| 2011 | Concolic Testing and Constraint Satisfaction. | Koushik Sen |
| 2011 | Faster Extraction of High-Level Minimal Unsatisfiable Cores. | Vadim Ryvchin, Ofer Strichman |
| 2011 | Between Restarts and Backjumps. | Antonio Ramos, Peter van der Tak, Marijn Heule |
| 2011 | Applying UCT to Boolean Satisfiability. | Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman |
| 2011 | The Order Encoding: From Tractable CSP to Tractable SAT. | Justyna Petke, Peter Jeavons |
| 2011 | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). | Sebastian Ordyniak, Danil Paulusma, Stefan Szeider |
| 2011 | Generating Diverse Solutions in SAT. | Alexander Nadel |
| 2011 | How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms. | Martin Mundhenk, Robert Zeranski |
| 2011 | Untitled record | Shin-ichi Minato |
| 2011 | Non-Model-Based Algorithm Portfolios for SAT. | Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann |
| 2011 | Failed Literal Detection for QBF. | Florian Lonsing, Armin Biere |
| 2011 | On Variables with Few Occurrences in Conjunctive Normal Forms. | Oliver Kullmann, Xishun Zhao |
| 2011 | Empirical Study of the Anatomy of Modern Sat Solvers. | Hadi Katebi, Karem A. Sakallah, Joo P. Marques Silva |
| 2011 | Abstraction-Based Algorithm for 2QBF. | Mikols Janota, Joo Marques-Silva |
| 2011 | DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions. | Alexey Ignatiev, Alexander A. Semenov |
| 2011 | Efficient CNF Simplification Based on Binary Implication Graphs. | Marijn Heule, Matti Jrvisalo, Armin Biere |