SAT

1. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
2. Empirical Study of the Anatomy of Modern Sat Solvers
3. Minimizing Learned Clauses
4. Engineering an efficient SAT solver

Branching

1. Using Rewarding Mechanisms for Improving Branching Heuristics
2. The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving
3. The Effect of VSIDS on SAT Solver Performance

Ranking Algorithms

1. Eigenvector Centrality