Jakob Nordström

Jakob Nordström

Københavns Universitet

H-index: 26

Europe-Denmark

About Jakob Nordström

Jakob Nordström, With an exceptional h-index of 26 and a recent h-index of 20 (since 2020), a distinguished researcher at Københavns Universitet, specializes in the field of Computational complexity, combinatorial optimization, proof logging, certifying algorithms.

His recent articles reflect a diverse array of research interests and contributions to the field:

Certifying MIP-based presolve reductions for 0-1 integer linear programs

End-to-End Verification for Subgraph Solving

Certified MaxSAT Preprocessing

Proof Logging for the Circuit Constraint

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning

Certified core-guided MaxSAT solving

Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz

Jakob Nordström Information

University

Position

and Lund University

Citations(all)

1910

Citations(since 2020)

1039

Cited By

1223

hIndex(all)

26

hIndex(since 2020)

20

i10Index(all)

53

i10Index(since 2020)

39

Email

University Profile Page

Københavns Universitet

Google Scholar

View Google Scholar Profile

Jakob Nordström Skills & Research Interests

Computational complexity

combinatorial optimization

proof logging

certifying algorithms

Top articles of Jakob Nordström

Title

Journal

Author(s)

Publication Date

Certifying MIP-based presolve reductions for 0-1 integer linear programs

Alexander Hoen

Andy Oertel

Ambros Gleixner

Jakob Nordström

2024/1/17

End-to-End Verification for Subgraph Solving

Stephan Gocht

Ciaran McCreesh

Magnus O Myreen

Jakob Nordström

Andy Oertel

...

2024

Certified MaxSAT Preprocessing

arXiv preprint arXiv:2404.17316

Hannes Ihalainen

Andy Oertel

Yong Kiam Tan

Jeremias Berg

Matti Järvisalo

...

2024/4/26

Proof Logging for the Circuit Constraint

Matthew J McIlree

Ciaran Mccreesh

Jakob Nordström

2024/2/2

Improving Conflict Analysis in MIP Solvers by Pseudo-Boolean Reasoning

Gioni Mexi

Timo Berthold

Ambros Gleixner

Jakob Nordström

2023/7/26

Certified core-guided MaxSAT solving

Jeremias Berg

Bart Bogaerts

Jakob Nordström

Andy Oertel

Dieter Vandesande

2023/7/1

Theory and Practice of SAT and Combinatorial Solving (Dagstuhl Seminar 22411)

Olaf Beyersdorff

Armin Biere

Vijay Ganesh

Jakob Nordström

Andy Oertel

2023

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz

Jonas Conneryd

Susanna F De Rezende

Jakob Nordström

Shuo Pang

Kilian Risse

2023/11/6

Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps

Journal of the ACM

Christoph Berkholz

Jakob Nordström

2023/10/12

Certified dominance and symmetry breaking for combinatorial optimisation

Journal of Artificial Intelligence Research

Bart Bogaerts

Stephan Gocht

Ciaran McCreesh

Jakob Nordström

2023/8/14

Certified CNF Translations for Pseudo-Boolean Solving

Stephan Gocht

Ruben Martins

Jakob Nordström

Andy Oertel

2022

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation (Including Appendices)

Proceedings of the AAAI Conference on Artificial Intelligence

Bart Bogaerts

Stephan Gocht

Ciaran McCreesh

Jakob Nordström

2022/6/28

An Auditable Constraint Programming Solver

Stephan Gocht

Ciaran McCreesh

Jakob Nordström

2022

Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification

Daniela Kaufmann

Paul Beame

Armin Biere

Jakob Nordström

2022/3/14

Proof complexity and SAT solving

Armin Biere

Marijn Heule

Hans van Maaren

Toby Walsh

2021

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

computational complexity

Susanna F De Rezende

Or Meir

Jakob Nordström

Robert Robere

2021/6

Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning

Proceedings of the AAAI Conference on Artificial Intelligence

Jo Devriendt

Stephan Gocht

Emir Demirović

Jakob Nordström

Peter J Stuckey

2021/5/18

Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs

Proceedings of the AAAI Conference on Artificial Intelligence

Stephan Gocht

Jakob Nordström

2021/5/18

Planning with Learned Binarized Neural Networks Benchmarks for MaxSAT Evaluation 2021

arXiv preprint arXiv:2108.00633

Buser Say

Scott Sanner

Jo Devriendt

Jakob Nordström

Peter J Stuckey

2021/8/2

Subgraph isomorphism meets cutting planes: solving with certified solutions

Stephan Gocht

Ciaran McCreesh

Jakob Nordström

2021/1/7

See List of Professors in Jakob Nordström University(Københavns Universitet)

Co-Authors

H-index: 65
Peter Stuckey

Peter Stuckey

Monash University

H-index: 24
Yuval Filmus

Yuval Filmus

Technion - Israel Institute of Technology

H-index: 23
Albert Atserias

Albert Atserias

Universidad Politécnica de Cataluña

H-index: 18
Ciaran McCreesh

Ciaran McCreesh

University of Glasgow

H-index: 16
Massimo Lauria

Massimo Lauria

Sapienza Università di Roma

H-index: 14
Or Meir

Or Meir

University of Haifa

academic-engine