| 2009 | SAT | Dynamic Symmetry Breaking by Simulating Zykov Contraction. | Bas Schaafsma, Marijn Heule, Hans van Maaren |
| 2008 | SAT | Finding Guaranteed MUSes Fast. | Hans van Maaren, Siert Wieringa |
| 2007 | SAT | From Idempotent Generalized Boolean Assignments to Multi-bit Search. | Marijn Heule, Hans van Maaren |
| 2007 | SAT | Effective Incorporation of Double Look-Ahead Procedures. | Marijn Heule, Hans van Maaren |
| 2005 | SAT | Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming. | Marijn Heule, Hans van Maaren |
| 2005 | SAT | Sums of Squares, Satisfiability and Maximum Satisfiability. | Hans van Maaren, Linda van Norden |
| 2004 | SAT | March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. | Marijn Heule, Mark Dufour, Joris E. van Zwieten, Hans van Maaren |
| 2004 | SAT | Aligning CNF- and Equivalence-reasoning. | Marijn Heule, Hans van Maaren |
| 2004 | SAT | Aligning CNF- and Equivalence-Reasoning. | Marijn Heule, Hans van Maaren |
| 2003 | SAT | Hidden Threshold Phenomena for Fixed-Density SAT-formulae. | Hans van Maaren, Linda van Norden |
| 2002 | CP | A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design. | Linda van Norden, Hans van Maaren |