Scheduling with two non-unit task lengths is NP-complete. - Jan Elffers; Mathijs de Weerdt (CoRR, 2014)

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. - Jan Elffers; Jan Johannsen; Massimo Lauria; Thomas Magnard; Jakob Nordström; Marc Vinyals (SAT, 2016)

CNFgen: A Generator of Crafted Benchmarks. - Massimo Lauria; Jan Elffers; Jakob Nordström; Marc Vinyals (SAT, 2017)

Seeking Practical CDCL Insights from Theoretical SAT Benchmarks. - Jan Elffers; Jesús Giráldez-Cru; Stephan Gocht; Jakob Nordström; Laurent Simon 001 (IJCAI, 2018)

Divide and Conquer: Towards Faster Pseudo-Boolean Solving. - Jan Elffers; Jakob Nordström (IJCAI, 2018)

Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. - Jan Elffers; Jesús Giráldez-Cru; Jakob Nordström; Marc Vinyals (SAT, 2018)

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. - Marc Vinyals; Jan Elffers; Jesús Giráldez-Cru; Stephan Gocht; Jakob Nordström (SAT, 2018)

Justifying All Differences Using Pseudo-Boolean Reasoning. - Jan Elffers; Stephan Gocht; Ciaran McCreesh; Jakob Nordström (AAAI, 2020)

A Cardinal Improvement to Pseudo-Boolean Solving. - Jan Elffers; Jakob Nordström (AAAI, 2020)

Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning. - Vincent Liew; Paul Beame; Jo Devriendt; Jan Elffers; Jakob Nordström (FMCAD, 2020)

Simplified and Improved Separations Between Regular and General Resolution by Lifting. - Marc Vinyals; Jan Elffers; Jan Johannsen; Jakob Nordström (SAT, 2020)