| 2020 | AAAI | Justifying All Differences Using Pseudo-Boolean Reasoning. | Jan Elffers, Stephan Gocht, Ciaran McCreesh, Jakob Nordstrm |
| 2020 | AAAI | A Cardinal Improvement to Pseudo-Boolean Solving. | Jan Elffers, Jakob Nordstrm |
| 2020 | FMCAD | Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning. | Vincent Liew, Paul Beame, Jo Devriendt, Jan Elffers, Jakob Nordstrm |
| 2020 | SAT | Simplified and Improved Separations Between Regular and General Resolution by Lifting. | Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordstrm |
| 2018 | IJCAI | Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. | Jan Elffers, Jess Girldez-Cru, Stephan Gocht, Jakob Nordstrm, Laurent Simon |
| 2018 | IJCAI | Divide and Conquer: Towards Faster Pseudo-Boolean Solving. | Jan Elffers, Jakob Nordstrm |
| 2018 | SAT | Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. | Jan Elffers, Jess Girldez-Cru, Jakob Nordstrm, Marc Vinyals |
| 2018 | SAT | In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. | Marc Vinyals, Jan Elffers, Jess Girldez-Cru, Stephan Gocht, Jakob Nordstrm |
| 2017 | SAT | CNFgen: A Generator of Crafted Benchmarks. | Massimo Lauria, Jan Elffers, Jakob Nordstrm, Marc Vinyals |
| 2016 | SAT | Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. | Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordstrm, Marc Vinyals |