Jakob Nordström
Scholar

Jakob Nordström

Google Scholar ID: YSFwWNIAAAAJ
University of Copenhagen and Lund University
Computational complexitycombinatorial optimizationproof loggingcertifying algorithms
Citations & Impact
All-time
Citations
1,460
 
H-index
23
 
i10-index
42
 
Publications
20
 
Co-authors
71
list available
Publications
4 items
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
IEEE Annual Symposium on Foundations of Computer Science · 2023
Cited
1
KRW Composition Theorems via Lifting
IEEE Annual Symposium on Foundations of Computer Science · 2020
Cited
15
Resume (English only)
Academic Achievements
  • Developed the pseudo-Boolean solver RoundingSat, which achieved top rankings in certified tracks of SAT 2025 competitions and placed in the top-10 of the non-certified optimization track.
  • VeriPB proof checker used in both SAT and Pseudo-Boolean Competitions affiliated with SAT 2025.
  • Organized multiple international workshops, including: 'Theory and Practice of SAT and Combinatorial Solving' (Banff, 2026); WHOOPS '25 (2025); SLOPPY '24 and WHOOPS '24 (2024); and 'Certifying Algorithms for Automated Reasoning' at Dagstuhl (2024).
  • Co-chaired the program committee for SAT 2025.
  • RoundingSat code base widely adopted by other top-performing solvers.