Jakob Nordström
ScholarGPS® ID: 59041234953328
Affiliation History
Discipline
Computer Science
Top Specialties
Calculus
Metrics Summary
Publication Count
40
Predicted Citations
490
Predicted h-index
13
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
Add
Delete
|
---|
KRW Composition Theorems via Lifting (journal article) computational complexity, volume 33, issue 1 (2024). |
End-to-End Verification for Subgraph Solving (journal article) Proceedings of the AAAI Conference on Artificial Intelligence, volume 38, issue 8, pages 8038-8047 (2024). |
Certified MaxSAT Preprocessing (book chapter) In Automated Reasoning Springer Nature Switzerland (2024) |
Certifying MIP-Based Presolve Reductions for $$0$$–$$1$$ Integer Linear Programs (book chapter) In Integration of Constraint Programming, Artificial Intelligence, and Operations Research Springer Nature Switzerland (2024) |
Proof Logging for the Circuit Constraint (book chapter) In Integration of Constraint Programming, Artificial Intelligence, and Operations Research Springer Nature Switzerland (2024) |
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (2023) Santa Cruz, CA, USA |
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps (journal article) Journal of the ACM, volume 70, issue 5, pages 1-32 (2023). |
Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23} (2023) Macau, SAR China |
Certified Core-Guided MaxSAT Solving (book chapter) In Automated Deduction – CADE 29 Springer Nature Switzerland (2023) |
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation (journal article) Proceedings of the AAAI Conference on Artificial Intelligence, volume 36, issue 4, pages 3698-3707 (2022). |
Learn to relax: Integrating 0-1 integer linear programming with pseudo-Boolean conflict-driven search (journal article) Constraints, volume 26, issue 1-4, pages 26-55 (2021). |
Clique Is Hard on Average for Regular Resolution (journal article) Journal of the ACM, volume 68, issue 4, pages 1-26 (2021). |
Proceedings Seventh Workshop on Proof eXchange for Theorem Proving (journal article) Electronic Proceedings in Theoretical Computer Science, volume 336 (2021). |
Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling (journal article) computational complexity, volume 30, issue 1 (2021). |
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs (journal article) Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, issue 5, pages 3768-3777 (2021). |
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning (journal article) Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, issue 5, pages 3750-3758 (2021). |
Chapter 7. Proof Complexity and SAT Solving (book chapter) In Handbook of Satisfiability IOS Press (2021) |
KRW Composition Theorems via Lifting (conference) 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA |
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) (2020) Durham, NC, USA |
Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems (book chapter) In Principles and Practice of Constraint Programming Springer International Publishing (2020) |